Dual Processor Scheduling with Dynamic Reassignment
- 1 July 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-5 (4) , 341-349
- https://doi.org/10.1109/tse.1979.234201
Abstract
The problem of finding an optimal dynamic assignment of a modular program for a two-processor system is analyzed. Stone's formulation of the static assignment problem is extended to include the cost of dynamically reassigning a module from one processor to the other and the cost of module residence without execution. By relocating modules during the course of program execution, changes in the locality of the program can be taken into account. It is shown that network flow algorithms may be used to find a dynamic assignment that minimizes the sum of module execution costs, module residence costs, intermodule communication costs, and module reassignment costs. Techniques for reducing the size of the problem are described for the case where the costs of residence are negligible.Keywords
This publication has 5 references indexed in Scilit:
- Critical Load Factors in Two-Processor Distributed SystemsIEEE Transactions on Software Engineering, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977
- Experience with distributed processing on a host/satellite graphics systemPublished by Association for Computing Machinery (ACM) ,1976
- Intelligent satellites for interactive graphicsProceedings of the IEEE, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972