Add to ORKGWe 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
In this paper we present several algorithms for performing all-to-many personalized communication on...
Communication overhead is one of the main factors that can limit the speedup of parallel programs on...
In this report we address the issue of loop tiling to minimize the completion time of the loop when ...
In this thesis we study the behavior of parallel applications represented by a precedence graph. The...
Causal message ordering is a partial ordering of messages in a distributed computing environment. It...
This thesis focus on the problem of scheduling the tasks of a parallel application taking into accou...
Parallelization of many irregular applications results in unstructured collective communication. In ...
Institute for Computing Systems ArchitectureProgrammers face daunting problems when attempting to de...
Abstract—Many parallel applications require periodic redistribution of workloads and associated data...
Scheduling is an important issue in parallel processing. Most scheduling algorithms makes assigns ta...
227 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.Most future supercomputers wi...
Parallelizing sparse irregular application on distributed memory systems poses serious scalability c...
This paper addresses certain types of scheduling problems that arise when a parallel computation is ...
AbstractThe aim of this paper is to present and analyze models for designing parallel programs. In t...
Data distribution functions are introduced. They are matced with scheduling functions. The processor...
In this paper we present several algorithms for performing all-to-many personalized communication on...
Communication overhead is one of the main factors that can limit the speedup of parallel programs on...
In this report we address the issue of loop tiling to minimize the completion time of the loop when ...
In this thesis we study the behavior of parallel applications represented by a precedence graph. The...
Causal message ordering is a partial ordering of messages in a distributed computing environment. It...
This thesis focus on the problem of scheduling the tasks of a parallel application taking into accou...
Parallelization of many irregular applications results in unstructured collective communication. In ...
Institute for Computing Systems ArchitectureProgrammers face daunting problems when attempting to de...
Abstract—Many parallel applications require periodic redistribution of workloads and associated data...
Scheduling is an important issue in parallel processing. Most scheduling algorithms makes assigns ta...
227 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.Most future supercomputers wi...
Parallelizing sparse irregular application on distributed memory systems poses serious scalability c...
This paper addresses certain types of scheduling problems that arise when a parallel computation is ...
AbstractThe aim of this paper is to present and analyze models for designing parallel programs. In t...
Data distribution functions are introduced. They are matced with scheduling functions. The processor...
In this paper we present several algorithms for performing all-to-many personalized communication on...
Communication overhead is one of the main factors that can limit the speedup of parallel programs on...
In this report we address the issue of loop tiling to minimize the completion time of the loop when ...