This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1979 (vol. 5 no. 4)
pp. 341-349
S.H. Bokhari, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center
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.
Index Terms:
partitioning, Computer networks, cutsets, distributed computers, dynamic assignment, load balancing, maximum flows, network flow
Citation:
S.H. Bokhari, "Dual Processor Scheduling with Dynamic Reassignment," IEEE Transactions on Software Engineering, vol. 5, no. 4, pp. 341-349, July 1979, doi:10.1109/TSE.1979.234201
Usage of this product signifies your acceptance of the Terms of Use.