NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Partitioning problems in parallel, pipelined, and distributed computingThe 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.
Document ID
19880034312
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Bokhari, Shahid H.
(University of Engineering and Technology Lahore, Pakistan)
Date Acquired
August 13, 2013
Publication Date
January 1, 1988
Publication Information
Publication: IEEE Transactions on Computers
Volume: 37
ISSN: 0018-9340
Subject Category
Computer Systems
Accession Number
88A21539
Funding Number(s)
CONTRACT_GRANT: NAS1-18107
CONTRACT_GRANT: NAS1-17070
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available