Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing

Authors:
Pierre Hansen;Keh-Wei Lih
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 4
Cited 7

Assignment problems in parallel and distributed computing

Assignment problems in parallel and distributed computing
Partitioning Problems in Parallel, Pipeline, and Distributed Computing

IEEE Transactions on Computers
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Journal of the ACM (JACM)

A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Distributed Multimedia Application Configuration Management

IEEE Transactions on Parallel and Distributed Systems
Efficient Partitioning of Sequences

IEEE Transactions on Computers
Fast optimal load balancing algorithms for 1D partitioning

Journal of Parallel and Distributed Computing
Optimising the time cost of multiple groups of parallel branches with two communication nodes within parallel structure

International Journal of Computer Applications in Technology
Mapping pipeline skeletons onto heterogeneous platforms

Journal of Parallel and Distributed Computing
Context-Aware Optimal Assignment of a Chain-Like Processing Task onto Chain-Like Resources in M-Health

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.