by Shamik D. Sharma, Joel Saltz, Joel Saltz, Raja Das, Raja Das, Yuan-shin Hwang, Yuan-shin Hwang, Bongki Moon, Bongki Moon, Ravi Ponnusamy, Ravi Ponnusamy, Shamik Sharma, Mustafa Uysal, Mustafa Uysal, Reinard Hanxeleden, Seema Hiranandani, Charles Koelbel, Ken Kennedy, Alok Choudhary, Geoffrey Fox, Sanjay Ranka
ftp://ftp.cs.umd.edu/pub/papers/papers/ncstrl.umcp/CS-TR-3437/CS-TR-3437.ps.Z
Add To MetaCart
Abstract:
Procedures are presented that are designed to help users efficiently program irregular problems (e.g. unstructured mesh sweeps, sparse matrix codes, adaptive mesh partial differential equations solvers) on distributed memory machines. These procedures are also designed for use in compilers for distributed memory multiprocessors. The portable CHAOS procedures are designed to support dynamic data distributions and to automatically generate
Citations
|
137
|
Communication optimizations for irregular scientific computations on distributed memory architectures
– Das, Uysal, et al.
- 1994
|
|
115
|
RunTime Parallelization and Scheduling of Loops
– Saltz, Mirchandaney, et al.
- 1991
|
|
114
|
Run-time scheduling and execution of loops on message passing machines
– Saltz, Crowley, et al.
- 1991
|
|
80
|
Principles of run-time support for parallel processors
– Mirchandaney, Saltz, et al.
- 1988
|
|
60
|
Run-time and Compile-time Support for Adaptive Irregular Problems
– Sharma, Ponnusamy, et al.
- 1994
|
|
59
|
Runtime Support and Compilation Methods for User Specified Data
– Ponnusamy, Saltz, et al.
- 1993
|
|
49
|
Slicing Analysis and Indirect Accesses to Distributed Arrays
– Das, Saltz, et al.
- 1993
|
|
46
|
Runtime-compilation techniques for data partitioning and communicationschedule reuse
– Ponnusamy, Saltz, et al.
- 1993
|
|
32
|
Compiler analysis for irregular problems in Fortran D
– Hanxleden, Kennedy, et al.
- 1992
|
|
21
|
Communication Optimizations for Irregular Scienti c Computations on Distributed Memory Architectures
– Das, Uysal, et al.
- 1994
|
|
20
|
PARTI primitives for unstructured and block structured problems
– Sussman, Saltz, et al.
- 1992
|
|
15
|
Performance of hashed cache data migration schemes on multicomputers
– Hiranandani, Saltz, et al.
- 1991
|
|
13
|
Runtime compilation for multiprocessors. Concurrency: Practice and Experience
– Saltz, Berryman, et al.
- 1991
|
|
3
|
Geo rey Fox. Runtime support and compilation methods for user-speci ed data distributions
– Ponnusamy, Saltz, et al.
- 1993
|
|
1
|
this version of the program, the X, Y, edge1, edge2 and IODegree CC arrays are initialized assuming a block distribution. #include "mpi.fort.h" integer idim, ne, buff C idim is the number of vertices in the graph parameter (idim=43) C NE is the
– In
|
