International audienceThe classical redistribution problem aims at optimally scheduling communications when reshuf-fling from an initial data distribution to a target data distribution. This target data distribution is usually chosen to optimize some objective for the algorithmic kernel under study (good computational balance or low communication volume or cost), and therefore to provide high efficiency for that kernel. However, the choice of a distribution minimizing the target objective is not unique. This leads to generalizing the redistribution problem as follows: find a re-mapping of data items onto processors such that the data redistribution cost is minimal, and the operation remains as efficient. This paper studies the complexity of...
Dynamic redistribution of arrays is required very often in programs on distributed memory parallel c...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
In this thesis, we study iterative algorithms onto heterogeneous platforms. These iterative algorith...
International audienceThe classical redistribution problem aims at optimally scheduling communicatio...
The classical redistribution problem aims at optimally scheduling communications when moving from an...
The classical redistribution problem aims at optimally scheduling communications when moving from an...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous ...
We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. ...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous ...
Many complicated parallel computing applications are composed of several stages. As the program proc...
(eng) Implementing linear algebra kernels on distributed memory parallel computers raises the proble...
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor ...
This paper discusses some algorithmic issues when computing with a heterogeneous network of workstat...
This paper presents communication-efficient algorithms for the external data redistribution problem....
Dynamic redistribution of arrays is required very often in programs on distributed memory parallel c...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
In this thesis, we study iterative algorithms onto heterogeneous platforms. These iterative algorith...
International audienceThe classical redistribution problem aims at optimally scheduling communicatio...
The classical redistribution problem aims at optimally scheduling communications when moving from an...
The classical redistribution problem aims at optimally scheduling communications when moving from an...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous ...
We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. ...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous ...
Many complicated parallel computing applications are composed of several stages. As the program proc...
(eng) Implementing linear algebra kernels on distributed memory parallel computers raises the proble...
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor ...
This paper discusses some algorithmic issues when computing with a heterogeneous network of workstat...
This paper presents communication-efficient algorithms for the external data redistribution problem....
Dynamic redistribution of arrays is required very often in programs on distributed memory parallel c...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
In this thesis, we study iterative algorithms onto heterogeneous platforms. These iterative algorith...