Improving compiler and run-time support for adaptive irregular codes

Irregular reductions form the core of adaptive irregular codes. On distributed-memory multiprocessors, they are parallelized either using sophisticated run-time systems (e.g., CHAOS, PILAR) or the shared-memory interface supported by software DSMs (e.g., GYM, TreadMarks). We introduce LOCALWRITE, a...

Full description

Saved in:
Bibliographic Details
Published inProceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192) pp. 393 - 400
Main Authors Hwansoo Han, Chau-Wen Tseng
Format Conference Proceeding
LanguageEnglish
Published IEEE 1998
Subjects
Application software
Chaos
Chaotic communication
Computer science
Educational institutions
Parallel processing
Research and development
Runtime
Software prototyping
Software systems
Online AccessGet full text

Cover

More Information
Summary:Irregular reductions form the core of adaptive irregular codes. On distributed-memory multiprocessors, they are parallelized either using sophisticated run-time systems (e.g., CHAOS, PILAR) or the shared-memory interface supported by software DSMs (e.g., GYM, TreadMarks). We introduce LOCALWRITE, a new technique based on the owner-computes rule which eliminates the need for buffers or synchronized writes but may replicate computation. We evaluate its performance for irregular codes while varying connectivity, locality, and adaptivity. LOCALWRITE improves performance by 50-150% compared to using replicated buffers, and can match or exceed gather/scatter for applications with low locality or high adaptivity.
ISBN:0818685913
9780818685910
ISSN:1089-795X
2641-7944
DOI:10.1109/PACT.1998.727289