The Community for Technology Leaders
Green Image
The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-sate
optimal program module assignment; computational resource allocation; scheduling; partition structure constraints; program partitioning; multiple-computer system; sum-bottleneck path algorithm; multiple chain-structures parallel programs; multiple arbitrarily structured serial programs; single-tree structured parallel programs; chain-connected systems; pipelined programs; distributed processing; programming theory; scheduling.
S.H. Bokhari, "Partitioning Problems in Parallel, Pipeline, and Distributed Computing", IEEE Transactions on Computers, vol. 37, no. , pp. 48-57, January 1988, doi:10.1109/12.75137
91 ms
(Ver 3.3 (11022016))