Issue No. 01 - January (1977 vol. 3)
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
maximum flows, Computer networks, cutsets, distributed computers, Ford-Fulkerson algorithm, load balancing
H. Stone, "Multiprocessor Scheduling with the Aid of Network Flow Algorithms," in IEEE Transactions on Software Engineering, vol. 3, no. , pp. 85-93, 1977.