IMPROVED ALGORITHMS FOR PARTITIONING PROBLEMS IN PARALLEL, PIPELINED, AND DISTRIBUTED COMPUTING

Bokhari studies the assignment of the modules of a parallel program to the processors of a multiple-computer system. He proposes 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 satellites systems. We solve here Problem 1 by dynamic programming and Problem 2 by sorting and using bisection search for the bottleneck value. We also note that Bokhari's algorithms for Problems 3 and 4 can be improved by using recent results of Gallo, Grigoriadis, and Tarjan and by implementing Dijkstra's algorithm, which is used as a subroutine, with a heap structure. The time complexity of all algorithm is thus reduced.