An LC branch-and-bound algorithm for the module assignment problem

DOI10.1016/0020-0190(89)90032-XzbMath0681.68042OpenAlexW2006677318MaRDI QIDQ1823674

Yanyan Li

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90032-x

zbMATH Keywords

branch-and- bound algorithmdistributed processing systemmodule assignment problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• On module assignment in two-processor distributed systems
• Analysis of the module assignment problem in distributed computing systems with limited storage
• Optimal partitioning of randomly generated distributed programs
• 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: An LC branch-and-bound algorithm for the module assignment problem