A Message Ordering Problem in Parallel Programs

We consider a certain class of parallel program segments in which the order of messages sent affects the completion time. We give characterization of these parallel program segments and propose a solution to minimize the completion time. With a sample parallel program, we experimentally evaluate the effect of the solution on a PC cluster.

• Type: Conference
• Year: 2004
• Where: PVM
• Authors: Bora Uçar, Cevdet Aykanat
• Keywords: Completion Time, Parallel Program Segments, PVM 2004, Sample Parallel Program