Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Partitioning problems in parallel, pipeline, and distributed computing
By: Bokhari, S.H.;
1988 / IEEE
This item was taken from the IEEE Periodical ' Partitioning problems in parallel, pipeline, and distributed computing ' 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.<
Optimal Program Module Assignment
Computational Resource Allocation
Partition Structure Constraints
Sum-bottleneck Path Algorithm
Multiple Chain-structures Parallel Programs
Multiple Arbitrarily Structured Serial Programs
Single-tree Structured Parallel Programs
Computing And Processing