Add to ORKGIn this paper, we study the communication characteristics of the CM-5 and the performance effects of scheduling regular and irregular communication patterns on the CM-5. We consider the scheduling of regular communication patterns such as complete exchange and broadcast. We have implemented four algorithms for complete exchange and studied their performances on a 2D FFT algorithm. We have also implemented four algorithms for scheduling irregular communication patterns and studied their performance on the communication patterns of several synthetic as well as real problems such as the conjugate gradient solver and the Euler solver
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
this article we investigate the trade-off between time and space efficiency in scheduling and execut...
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, al...
In this paper, we study the communication characteristics of the CM-5 and the performance effects of...
Parallelization of many irregular applications results in unstructured collective communication. In ...
In this paper we present several algorithms for performing all-to-many personalized communication on...
We conduct a detailed study of the performance effects of irregular communications patterns on the C...
Thinking Machines\u27 CM-5 machine is a distributed-memory, message-passing computer. In this paper ...
In this paper, we develop portable and scalable algorithms for performing irregular all-to-all commu...
In irregular all-to-all communication, messages are exchanged between every pair of processors. The ...
Parallelizing sparse irregular application on distributed memory systems poses serious scalability c...
This thesis focus on the problem of scheduling the tasks of a parallel application taking into accou...
In this thesis we study the behavior of parallel applications represented by a precedence graph. The...
In this paper we present several algorithms for all-too-many personalized communications which avoid...
Motivated by observations about job runtimes on the CPlant system, we use a trace-driven microsimula...
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
this article we investigate the trade-off between time and space efficiency in scheduling and execut...
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, al...
In this paper, we study the communication characteristics of the CM-5 and the performance effects of...
Parallelization of many irregular applications results in unstructured collective communication. In ...
In this paper we present several algorithms for performing all-to-many personalized communication on...
We conduct a detailed study of the performance effects of irregular communications patterns on the C...
Thinking Machines\u27 CM-5 machine is a distributed-memory, message-passing computer. In this paper ...
In this paper, we develop portable and scalable algorithms for performing irregular all-to-all commu...
In irregular all-to-all communication, messages are exchanged between every pair of processors. The ...
Parallelizing sparse irregular application on distributed memory systems poses serious scalability c...
This thesis focus on the problem of scheduling the tasks of a parallel application taking into accou...
In this thesis we study the behavior of parallel applications represented by a precedence graph. The...
In this paper we present several algorithms for all-too-many personalized communications which avoid...
Motivated by observations about job runtimes on the CPlant system, we use a trace-driven microsimula...
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
this article we investigate the trade-off between time and space efficiency in scheduling and execut...
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, al...