This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
January 1977 (vol. 3 no. 1)
pp. 85-93
H.S. Stone, Department of Electrical and Computer Engineering, University of Massachusetts
In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive interprocessor communication while taking advantage of specific efficiencies of some processors in executing some program modules. In this paper we show that this program module assignment problem can be solved efficiently by making use of the well-known Ford
Index Terms:
maximum flows, Computer networks, cutsets, distributed computers, Ford-Fulkerson algorithm, load balancing
Citation:
H.S. Stone, "Multiprocessor Scheduling with the Aid of Network Flow Algorithms," IEEE Transactions on Software Engineering, vol. 3, no. 1, pp. 85-93, Jan. 1977, doi:10.1109/TSE.1977.233840
Usage of this product signifies your acceptance of the Terms of Use.