Sciweavers

55 search results - page 4 / 11
» Processor affinity and MPI performance on SMP-CMP clusters
Sort
View
CLUSTER
2004
IEEE
13 years 10 months ago
FTC-Charm++: an in-memory checkpoint-based fault tolerant runtime for Charm++ and MPI
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
Gengbin Zheng, Lixia Shi, Laxmikant V. Kalé
CF
2004
ACM
13 years 11 months ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
IPPS
2009
IEEE
14 years 27 days ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
CLUSTER
2004
IEEE
13 years 10 months ago
On optimizing collective communication
In this paper we discuss issues related to the highperformance implementation of collective communications operations on distributed-memory computer architectures. Using a combina...
E. W. Chan, M. F. Heimlich, Avi Purkayastha, Rober...
SC
2005
ACM
13 years 11 months ago
Optimizing All-to-All Collective Communication by Exploiting Concurrency in Modern Networks
The paper proposes a novel approach for optimizing performance of all-to-all collective communication by taking advantage of concurrency available in modern networks such as Infin...
Vinod Tipparaju, Jarek Nieplocha