A message ordering problem in parallel programs
Date
2004
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Print ISSN
0302-9743
1611-3349
1611-3349
Electronic ISSN
Publisher
Springer
Volume
3241
Issue
Pages
131 - 138
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
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. © Springer-Verlag 2004.