Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Message Ordering Problem in Parallel Programs
 

Summary: A Message Ordering Problem
in Parallel Programs
Bora U¸car and Cevdet Aykanat
Department of Computer Engineering, Bilkent University, 06800, Ankara, Turkey
{ubora,aykanat}@cs.bilkent.edu.tr
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 solu-
tion to minimize the completion time. With a sample parallel program,
we experimentally evaluate the effect of the solution on a PC cluster.
1 Introduction
We consider a certain class of parallel program segments with the following char-
acteristics. First, there is a small-to-medium grain computation between two
communication phases which are referred to as pre- and post-communication
phases. Second, local computations cannot start before the pre-communication
phase ends, and the post-communication phase cannot start before the compu-
tation ends. Third, the communication in both phases is irregular and sparse.
That is, the communications are performed using point-to-point send and re-
ceive operations, where the sparsity refers to small number of messages having
small sizes. These traits appear, for example, in the sparse-matrix vector multi-

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University
Uçar, Bora - Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon

 

Collections: Computer Technologies and Information Sciences