A message segmentation technique to minimize task completion time

摘要

Optimal partitioning of multiprocessor programs is a trade-off: asthe granularity of subtasks of a parallel task increases, thecommunication overhead decreases but so does the total parallelism. Theauthors propose a new technique to determine the optimal segment size ofmessages between a producer and a consumer to minimize the overallexecution time, and apply it to allocation of DOACROSS loops