Add to ORKGAbstract. The data redistribution problems on multi-computers had been extensively studied. Irregular data redistribution has been paid attention recently since it can distribute different size of data segment of each processor to processors according to their own computation capability. High Performance Fortran Version 2 (HPF-2) provides GEN_BLOCK data distribution method for generating irregular data distribution. In this paper, we develop an efficient scheduling algorithm, Smallest Conflict Points Algorithm (SCPA), to schedule HPF2 irregular array redistribution. SCPA is a near optimal scheduling algorithm, which satisfies the minimal number of steps and minimal total messages size of steps for irregular data redistribution
Languages such as Fortran D provide irregular distribution schemes that can efficiently support irre...
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
Abstract. In order to achieve higher load balancing, it is necessary to solve irregular block redist...
Data redistribution has been widely studied in the literature. In recent years, several papers propo...
Many complicated parallel computing applications are composed of several stages. As the program proc...
International audienceThis article is devoted to the run-time redistribution of one-dimensional arra...
Colloque avec actes sans comité de lecture. nationale.National audienceWith the emergence of large s...
Languages such as High Performance Fortran implement parallel algorithms by distributing large data ...
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture indepen...
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations ...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we stud...
International audienceWe study the problem of redistributing data between clusters interconnected by...
Abstract. Array redistribution is required often in programs on distributed memory parallel computer...
Three related problems, among others, are faced when trying to execute an algorithm on a parallel ma...
Languages such as Fortran D provide irregular distribution schemes that can efficiently support irre...
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...
Abstract. In order to achieve higher load balancing, it is necessary to solve irregular block redist...
Data redistribution has been widely studied in the literature. In recent years, several papers propo...
Many complicated parallel computing applications are composed of several stages. As the program proc...
International audienceThis article is devoted to the run-time redistribution of one-dimensional arra...
Colloque avec actes sans comité de lecture. nationale.National audienceWith the emergence of large s...
Languages such as High Performance Fortran implement parallel algorithms by distributing large data ...
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture indepen...
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations ...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we stud...
International audienceWe study the problem of redistributing data between clusters interconnected by...
Abstract. Array redistribution is required often in programs on distributed memory parallel computer...
Three related problems, among others, are faced when trying to execute an algorithm on a parallel ma...
Languages such as Fortran D provide irregular distribution schemes that can efficiently support irre...
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
[[abstract]]Array redistribution is usually required, to enhance algorithm performance in many paral...