Run-time scheduling and execution of loops on message passing machines

Journal Article · Sun Apr 01 00:00:00 EST 1990 · Journal of Parallel and Distributed Computing; (USA)

DOI:https://doi.org/10.1016/0743-7315(90)90129-D· OSTI ID:6779468

Saltz, J; Crowley, K; Mirchandaney, R; Berryman, H ^[1]

---

1. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA (US)

The authors examine the effectiveness of optimizations aimed a allowing a distributed machine to efficiently compute inner loops over globally defined data structures. Their optimizations are specifically targeted toward loops in which some array references are made through a level of indirection. Unstructured mesh codes and sparse matrix solvers are examples of programs with kernels of this sort. Experimental data that quantify the performance obtainable using the methods discussed are included.

• OSTI ID: 6779468
• Journal Information: Journal of Parallel and Distributed Computing; (USA), Vol. 8:4; ISSN 0743-7315
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
DISTRIBUTED DATA PROCESSING
OPTIMIZATION
MESH GENERATION
COMPUTER CODES
EXPERIMENTAL DATA
PERFORMANCE TESTING
S MATRIX
DATA
DATA PROCESSING
INFORMATION
MATRICES
NUMERICAL DATA
PROCESSING
TESTING
990200* - Mathematics & Computers