This paper presents communication-efficient algorithms for the external data redistribution problem. Deterministic lower bounds and upper bounds are presented for the number of I/O operations, communication time and the memory requirements of external redistribution. Our algorithms differ from most other algorithms presented for out-of-core applications in that it is optimal (within a small constant factor) not only in the number of I/O operations, but also in the time taken for communication. A coarse-grained MIMD architecture with I/O subsystems attached to each processor is assumed, but the results are expected to be applicable over a wider variety of architectures
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
Abstract—Many parallel applications require periodic redistribution of workloads and associated data...
In this paper we present several algorithms for performing all-to-many personalized communication on...
In this paper we propose a new approach to the study of the communication requirements of distribute...
Data sets in large applications are often too massive to fit completely inside the computer’s intern...
Abstract. Array redistribution is required often in programs on distributed memory parallel computer...
In this paper we propose a new approach to the study of the communication requirements of distribute...
The classical redistribution problem aims at optimally scheduling communications when moving from an...
. Data sets in large applications are often too massive to fit completely inside the computer's...
International audienceThe classical redistribution problem aims at optimally scheduling communicatio...
In this paper, we show that communication in the out-of-core distributed memory problems requires bo...
This paper describes a number of optimizations that can be used to support the efficient execution o...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
We present algorithms for the transportation of data in parallel and distributed systems that would ...
Reducing communication overhead is extremely important in distributed-memory message-passing archite...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
Abstract—Many parallel applications require periodic redistribution of workloads and associated data...
In this paper we present several algorithms for performing all-to-many personalized communication on...
In this paper we propose a new approach to the study of the communication requirements of distribute...
Data sets in large applications are often too massive to fit completely inside the computer’s intern...
Abstract. Array redistribution is required often in programs on distributed memory parallel computer...
In this paper we propose a new approach to the study of the communication requirements of distribute...
The classical redistribution problem aims at optimally scheduling communications when moving from an...
. Data sets in large applications are often too massive to fit completely inside the computer's...
International audienceThe classical redistribution problem aims at optimally scheduling communicatio...
In this paper, we show that communication in the out-of-core distributed memory problems requires bo...
This paper describes a number of optimizations that can be used to support the efficient execution o...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
We present algorithms for the transportation of data in parallel and distributed systems that would ...
Reducing communication overhead is extremely important in distributed-memory message-passing archite...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
Abstract—Many parallel applications require periodic redistribution of workloads and associated data...
In this paper we present several algorithms for performing all-to-many personalized communication on...