Partitioning problems in parallel, pipelined, 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-structured 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. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple-computer architectures for a wide range of problems of practical interest.
- Research Organization:
- Dept. of Electrical Engineering, Univ. of Engineering and Technology, Lahore-31 (PK)
- OSTI ID:
- 5288769
- Journal Information:
- IEEE Trans. Comput.; (United States), Vol. 37:1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems
LDRD final report on massively-parallel linear programming : the parPCx system.
Related Subjects
SUPERCOMPUTERS
DISTRIBUTED DATA PROCESSING
PARALLEL PROCESSING
ALGORITHMS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTER CODES
EFFICIENCY
OPTIMIZATION
COMPUTERS
DATA PROCESSING
DIGITAL COMPUTERS
MATHEMATICAL LOGIC
PROCESSING
PROGRAMMING
990220* - Computers
Computerized Models
& Computer Programs- (1987-1989)