Issue No. 10 - Oct. (1986 vol. 12)
Don Towsley , Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003
This paper addresses the problem of assigning the modules of a distributed program to the processors of a distributed system. The goal of such an assignment is to minimize the total execution and communication costs. A computational model of a distributed program, containing probabilistic branches and loops, is described using a directed graph whose edges represent precedence relations between modules. Efficient algorithms based on shortest path methods are presented to determine the optimum assignment on a distributed system containing N heterogeneous processors.
Computational modeling, Resource management, Algorithm design and analysis, Computational efficiency, Computational complexity, Context, shortest path algorithms, Computer networks, distributed processing, multiprocessor system scheduling
D. Towsley, "Allocating programs containing branches and loops within a multiple processor system," in IEEE Transactions on Software Engineering, vol. 12, no. , pp. 1018-1024, 1986.