Analysis of the module assignment problem in distributed computing systems with limited storage

DOI10.1016/0020-0190(80)90058-7zbMath0442.68027OpenAlexW2055873841MaRDI QIDQ1143787

S. H. Smith

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90058-7

zbMATH Keywords

limited storagedistributed computing systemsmodule assignment

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Related Items (2)

A methodology for multicriteria network partitioning ⋮ An LC branch-and-bound algorithm for the module assignment problem

Cites Work

• On module assignment in two-processor distributed systems
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Assignment of Tasks in a Distributed Processor System with Limited Memory

This page was built for publication: Analysis of the module assignment problem in distributed computing systems with limited storage