An LC branch-and-bound algorithm for the module assignment problem
- 1 July 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 32 (2) , 61-71
- https://doi.org/10.1016/0020-0190(89)90032-x
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Heuristic algorithms for task assignment in distributed systemsIEEE Transactions on Computers, 1988
- A taxonomy of scheduling in general-purpose distributed computing systemsIEEE Transactions on Software Engineering, 1988
- Task Allocation and Precedence Relations for Distributed Real-Time SystemsIEEE Transactions on Computers, 1987
- Optimal partitioning of randomly generated distributed programsIEEE Transactions on Software Engineering, 1986
- A Task Allocation Model for Distributed Computing SystemsIEEE Transactions on Computers, 1982
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- Analysis of the module assignment problem in distributed computing systems with limited storageInformation Processing Letters, 1980
- On module assignment in two-processor distributed systemsInformation Processing Letters, 1979
- Dual Processor Scheduling with Dynamic ReassignmentIEEE Transactions on Software Engineering, 1979
- Assignment of Tasks in a Distributed Processor System with Limited MemoryIEEE Transactions on Computers, 1979