A message segmentation technique to minimize task completion time

Optimal partitioning of multiprocessor programs is a trade-off: as the granularity of subtasks of a parallel task increases, the communication overhead decreases but so does the total parallelism. The authors propose a new technique to determine the optimal segment size of messages between a produce...

Full description

Saved in:
Bibliographic Details
Published in[1991] Proceedings. The Fifth International Parallel Processing Symposium pp. 519 - 524
Main Authors Kim, S., Pande, S.S., Agrawal, D.P., Mauney, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1991
Subjects
Character generation
Communication channels
Concurrent computing
Context
Costs
Electronic mail
Hypercubes
Magnetic heads
Partitioning algorithms
Yarn
Online AccessGet full text

Cover

More Information
Summary:Optimal partitioning of multiprocessor programs is a trade-off: as the granularity of subtasks of a parallel task increases, the communication overhead decreases but so does the total parallelism. The authors propose a new technique to determine the optimal segment size of messages between a producer and a consumer to minimize the overall execution time, and apply it to allocation of DOACROSS loops.< >
ISBN:0818691670
9780818691676
DOI:10.1109/IPPS.1991.153830