Scheduling with sufficient loosely coupled processors
- 1 May 1990
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 9 (1), 87-92
- https://doi.org/10.1016/0743-7315(90)90116-7
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Scheduling Precedence Graphs in Systems with Interprocessor Communication TimesSIAM Journal on Computing, 1989
- Multiprocessor scheduling with interprocessor communication delaysOperations Research Letters, 1988
- A Communication-Time TradeoffSIAM Journal on Computing, 1987
- Estimation of Intermodule Communication (IMC) and Its Applications in Distributed Processing SystemsIEEE Transactions on Computers, 1984
- Load Balancing in Distributed SystemsIEEE Transactions on Software Engineering, 1982
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor SystemIEEE Transactions on Computers, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969