A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System
Issue No.06 - November (1981 vol.7)
S.H. Bokhari , Department of Electrical Engineering, University of Engineering and Technology
The problem of optimally assigning the modules of a program over the processors of an inhomogeneous distributed processor system is analyzed. The objective is to assign modules, wherever possible, to the processors on which they execute most rapidly while taking into account the overhead of interprocessor communication. Factors contributing to the cost of an assignment are 1) the amount of computation required by each module, 2) the amount of data transmitted between each pair of modules, 3) the speed of each processor, and 4) the speed of the communication link between each pair of processors.
shortest trees, Computer networks, distributed processing, precedence trees, program assignment, scheduling
S.H. Bokhari, "A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System", IEEE Transactions on Software Engineering, vol.7, no. 6, pp. 583-589, November 1981, doi:10.1109/TSE.1981.226469