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 producer and a consumer to minimize the overall execution time, and apply it to allocation of DOACROSS loops.<>