Issue No. 06 - June (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.144628
<p>S.H. Bokhari has studied the assignment of the modules of a parallel program to the processors of a multiple-computer system. He proposed algorithms to solve optimally the following problems: (1) partition chain-structured parallel or pipelined programs over chain-connected systems; (2) partition multiple chain-structured parallel or pipelined programs over single-host multiple satellite systems; (3) partition multiple arbitrarily structured serial programs over single-host multiple-satellite systems; (4) partition single-tree structured parallel or pipelined programs over single-host multiple identical satellite systems. The authors solve here problem 1 by dynamic programming and problem 2 by sorting and using bisection search for the bottleneck value. They also note that Bokhari's algorithms for problems 3 and 4 can be improved by using recent results of G. Gallo et al. (1989), and by implementing E.W. Dijkstra's (1959) algorithm, which is used as a subroutine, with a heap structure. The time complexity of all algorithms is thus reduced.</p>
partitioning problems; parallel; pipelined; distributed computing; parallel program; bottleneck value; time complexity; computational complexity; parallel programming.
K. Lih and P. Hansen, "Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing," in IEEE Transactions on Computers, vol. 41, no. , pp. 769-771, 1992.