|
1. |
Partitioning problems in parallel, pipeline, and distributed computing
Bokhari, S.H.;
Computers, IEEE Transactions on
Volume 37,
Issue 1,
Jan. 1988
Page(s):48
-
57
Abstract:
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-satellite system: partitioning multiple chain-structures parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs
|
Cart
