Execution time support for scientific programs on distributed memory machinesOptimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out 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 carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.
Document ID
19910048445
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Berryman, Harry (NASA Langley Research Center Hampton, VA, United States)
Saltz, Joel (NASA Langley Research Center; ICASE, Hampton, VA; Yale University New Haven, CT, United States)
Scroggs, Jeffrey (Yale University New Haven, CT, United States)