Toward Automatic Data Distribution for Migrating Computations

2007 ◽  
Author(s):  
Lei Pan ◽  
Jingling Xie ◽  
Ming Kin Lai ◽  
Michael B. Dillencourt ◽  
Lubomir F. Bic
Keyword(s):  
Data Distribution ◽  
Automatic Data ◽  
Automatic Data Distribution

Data redistribution in an automatic data distribution tool

1996 ◽  
pp. 407-421 ◽  
Author(s):  
Eduard Ayguadé ◽  
Jordi Garcia ◽  
Mercè Gironès ◽  
M. Luz Grande ◽  
Jesús Labarta
Keyword(s):  
Data Distribution ◽  
Automatic Data ◽  
Automatic Data Distribution ◽  
Data Redistribution

scholarly journals Automatic Data Distribution in Large-scale OLTP Applications

2014 ◽  
Vol 7 (4) ◽  
pp. 37-46 ◽  
Author(s):  
Xiaoyan Wang ◽  
Xu Fan ◽  
Jinchuan Chen ◽  
Xiaoyong Du
Keyword(s):  
Large Scale ◽  
Data Distribution ◽  
Automatic Data ◽  
Automatic Data Distribution

scholarly journals Automatic Data Distribution for Composite Grid Applications

1997 ◽  
Vol 6 (1) ◽  
pp. 95-113 ◽  
Author(s):  
Lorie M. Liebrock ◽  
Ken Kennedy
Keyword(s):  
Large Class ◽  
High Performance ◽  
Nuclear Reactor ◽  
Data Distribution ◽  
Fortran Program ◽  
Simulation Code ◽  
Automatic Data ◽  
Automatic Data Distribution ◽  
Grid Applications ◽  
Composite Grid

Problem topology is the key to efficient parallelization support for partially regular applications. Specifically, problem topology provides the information necessary for automatic data distribution and regular application optimization of a large class of partially regular applications. Problem topology is the connectivity of the problem. This research focuses on composite grid applications and strives to take advantage of their partial regularity in the parallelization and compilation process. Composite grid problems arise in important application areas, e.g., reactor and aerodynamic simulation. Related physical phenomena are inherently parallel and their simulations are computationally intensive. We present algorithms that automatically determine data distributions for composite grid problems. Our algorithm's alignment and distribution specifications may be used as input to a High Performance Fortran program to apply the mapping for execution of the simulation code. These algorithms eliminate the need for user-specified data distribution for this large class of complex topology problems. We test the algorithms using a number of topological descriptions from aerodynamic and water-cooled nuclear reactor simulations. Speedup-bound predictions with and without communication, based on the automatically generated distributions, indicate that significant speedups are possible using these algorithms.

Sign in / Sign up

Export Citation Format

Share Document