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 theirperformances 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
The results presented in this document concern scheduling forlarge-scale heterogeneous platforms. We...
A static algorithm for allocating and scheduling components of complex periodic tasks across sites i...
[[abstract]]The authors propose a new concept, the conflict-based algorithm, to derive efficient alg...
In this paper, we study the communication characteristics of the CM-5 and the performance effects of...
We conduct a detailed study of the performance effects of irregular communications patterns on the C...
In this paper, we develop portable and scalable algorithms for performing irregular all-to-all commu...
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...
In irregular all-to-all communication, messages are exchanged between every pair of processors. The ...
Motivated by observations about job runtimes on the CPlant system, we use a trace-driven microsimula...
AbstractThis paper defines and studies an approximation algorithm for scheduling tasks with small co...
this paper, we propose a communication cost reduction computes rule for irregular loop partitioning...
In this paper, we propose a communication cost reduction computes rule for irregular loop partitioni...
AbstractThis paper is a survey of existing methods of communication in usual networks. We particular...
Coscheduling of communication and computation is considered one of the crucial points to obtain good...
The results presented in this document concern scheduling forlarge-scale heterogeneous platforms. We...
A static algorithm for allocating and scheduling components of complex periodic tasks across sites i...
[[abstract]]The authors propose a new concept, the conflict-based algorithm, to derive efficient alg...
In this paper, we study the communication characteristics of the CM-5 and the performance effects of...
We conduct a detailed study of the performance effects of irregular communications patterns on the C...
In this paper, we develop portable and scalable algorithms for performing irregular all-to-all commu...
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...
In irregular all-to-all communication, messages are exchanged between every pair of processors. The ...
Motivated by observations about job runtimes on the CPlant system, we use a trace-driven microsimula...
AbstractThis paper defines and studies an approximation algorithm for scheduling tasks with small co...
this paper, we propose a communication cost reduction computes rule for irregular loop partitioning...
In this paper, we propose a communication cost reduction computes rule for irregular loop partitioni...
AbstractThis paper is a survey of existing methods of communication in usual networks. We particular...
Coscheduling of communication and computation is considered one of the crucial points to obtain good...
The results presented in this document concern scheduling forlarge-scale heterogeneous platforms. We...
A static algorithm for allocating and scheduling components of complex periodic tasks across sites i...
[[abstract]]The authors propose a new concept, the conflict-based algorithm, to derive efficient alg...