Title :
A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System
Author :
Bokhari, Shahid H.
Author_Institution :
Department of Electrical Engineering, University of Engineering and Technology
Abstract :
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.
Keywords :
Computer networks; distributed processing; precedence trees; program assignment; scheduling; shortest trees; Computer applications; Cost function; Delay; Distributed processing; Dynamic programming; Heuristic algorithms; NASA; Processor scheduling; Scheduling algorithm; Space technology; Computer networks; distributed processing; precedence trees; program assignment; scheduling; shortest trees;
Journal_Title :
Software Engineering, IEEE Transactions on
DOI :
10.1109/TSE.1981.226469
