A message ordering problem in parallel programs
Date
2004
Authors
Uçar, B.
Aykanat, Cevdet
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
0
views
views
9
downloads
downloads
Citation Stats
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.
Source Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher
Springer
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English
Type
Article