International audienceWe consider the problem of redistributing data on homogeneous and heterogeneous rings of processors. The problem arises in several applications, after each invoca-tion of a load-balancing mechanism (but we do not discuss the load-balancing mechanism itself). We provide algorithms that aim at optimizing the data redistribution, both for unidirectional and bidirectional rings. One major contribution of the paper is that we are able to prove the opti-mality of the proposed algorithms in all cases except that of a bidirectional heterogeneous ring, for which the problem remains open.no abstrac
Dans cette thèse, nous nous sommes intéressée à la mise en oeuvre d'algorithmes itératifs sur des gr...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous ...
International audienceRedistribution algorithms for dense linear algebra kernels on heterogeneous pl...
We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. ...
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor ...
We consider the problem of redistributing data on homo-geneous and heterogeneous rings of processors...
In this thesis, we study iterative algorithms onto heterogeneous platforms. These iterative algorith...
International audienceThe classical redistribution problem aims at optimally scheduling communicatio...
This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application d...
The Block Cyclic Array Redistribution problem occurs in many important applications in parallel comp...
International audienceWe focus on mapping iterative algorithms onto heterogeneous clusters. The appl...
International audienceThis paper is devoted to mapping iterative algorithms onto heterogeneous clust...
This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application d...
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...
Dans cette thèse, nous nous sommes intéressée à la mise en oeuvre d'algorithmes itératifs sur des gr...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous ...
International audienceRedistribution algorithms for dense linear algebra kernels on heterogeneous pl...
We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. ...
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor ...
We consider the problem of redistributing data on homo-geneous and heterogeneous rings of processors...
In this thesis, we study iterative algorithms onto heterogeneous platforms. These iterative algorith...
International audienceThe classical redistribution problem aims at optimally scheduling communicatio...
This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application d...
The Block Cyclic Array Redistribution problem occurs in many important applications in parallel comp...
International audienceWe focus on mapping iterative algorithms onto heterogeneous clusters. The appl...
International audienceThis paper is devoted to mapping iterative algorithms onto heterogeneous clust...
This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application d...
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...
Dans cette thèse, nous nous sommes intéressée à la mise en oeuvre d'algorithmes itératifs sur des gr...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous ...
International audienceRedistribution algorithms for dense linear algebra kernels on heterogeneous pl...