Execution time support for adaptive scientific algorithms on distributed memory machines
H Berryman, J Saltz, J Scroggs - Concurrency: Practice and …, 1991 - Wiley Online Library
H Berryman, J Saltz, J Scroggs
Concurrency: Practice and Experience, 1991•Wiley Online LibraryWe consider optimizations that are required for efficient execution of code segments that
consist of loops over distributed data structures. The PARTI execution time primitives are
designed to perform these optimizations and can be used to Implement a wide range of
scientific algorithms on distributed memory machines. These primitives allow the user to
control array mappings in a way that gives an appearance of shared memory. Computations
can be based on a global index set. Primitives are used to perform gather and scatter …
consist of loops over distributed data structures. The PARTI execution time primitives are
designed to perform these optimizations and can be used to Implement a wide range of
scientific algorithms on distributed memory machines. These primitives allow the user to
control array mappings in a way that gives an appearance of shared memory. Computations
can be based on a global index set. Primitives are used to perform gather and scatter …
Abstract
We consider optimizations that are required for efficient execution of code segments that consist of loops over distributed data structures. The PARTI execution time primitives are designed to perform these optimizations and can be used to Implement a wide range of scientific algorithms on distributed memory machines.
These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to perform gather and scatter operations on distributed arrays. Communications patterns are derived at run time, and the appropriate send and receive messages are automatically generated.
Wiley Online Library