Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAFT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAFT are efficient three pass algorithms. Most algorith...
this report we have described how two methods for automatically determining convenient data distribu...
We consider distribution at compile time of the array data in a distributed-memory implementation of...
This paper presents a framework to find good distributions for the global arrays at different progra...
In this paper we present a method to obtain a set of candidate distributions for a program fragment....
Problem topology is the key to efficient parallelization support for partially regular applications....
Data parallel programming languages, such as HPF, are the easiest way to program Distributed Memory ...
An approach to programming distributed memory-parallel machines that has recently become popular is ...
Massively Parallel Processor systems provide the required computational power to solve most large sc...
Parallel architectures with physically distributed memory providing computing cycles and large amoun...
In this paper, an efficient algorithm to simultaneously implement array alignment and data/computat...
This paper describes an automatic data distribution method which deal with both the alignment and th...
Parallel computing is now widely used in numerical simulation, particularly for application codes ba...
Computational Fluid Dynamics (CFD) applications are highly demanding for parallel computing. Many su...
(eng) In this paper, an efficient algorithm to simultaneously implement array alignment and data/com...
Many large-scale computational applications contain irregular data access patterns related to unstru...
this report we have described how two methods for automatically determining convenient data distribu...
We consider distribution at compile time of the array data in a distributed-memory implementation of...
This paper presents a framework to find good distributions for the global arrays at different progra...
In this paper we present a method to obtain a set of candidate distributions for a program fragment....
Problem topology is the key to efficient parallelization support for partially regular applications....
Data parallel programming languages, such as HPF, are the easiest way to program Distributed Memory ...
An approach to programming distributed memory-parallel machines that has recently become popular is ...
Massively Parallel Processor systems provide the required computational power to solve most large sc...
Parallel architectures with physically distributed memory providing computing cycles and large amoun...
In this paper, an efficient algorithm to simultaneously implement array alignment and data/computat...
This paper describes an automatic data distribution method which deal with both the alignment and th...
Parallel computing is now widely used in numerical simulation, particularly for application codes ba...
Computational Fluid Dynamics (CFD) applications are highly demanding for parallel computing. Many su...
(eng) In this paper, an efficient algorithm to simultaneously implement array alignment and data/com...
Many large-scale computational applications contain irregular data access patterns related to unstru...
this report we have described how two methods for automatically determining convenient data distribu...
We consider distribution at compile time of the array data in a distributed-memory implementation of...
This paper presents a framework to find good distributions for the global arrays at different progra...