Compile-time synchronization optimizations for software DSMs

Sofware distributed-shared-memory (DSM) systems provide a desirable target for parallelizing compilers due to their flexibility. However, studies show synchronization and load imbalance are significant sources of overhead. The authors investigate the impact of compilation techniques for eliminating...

Full description

Saved in:
Bibliographic Details
Published inProceedings - International Parallel Processing Symposium pp. 662 - 669
Main Authors Han, Hwansoo, Tseng, Chau-Wen
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 1998
Subjects
Algorithm design and analysis
Application software
Computer science
Educational institutions
Parallel processing
Program processors
Programming profession
Software algorithms
Software systems
Time measurement
Online AccessGet full text

Cover

More Information
Summary:Sofware distributed-shared-memory (DSM) systems provide a desirable target for parallelizing compilers due to their flexibility. However, studies show synchronization and load imbalance are significant sources of overhead. The authors investigate the impact of compilation techniques for eliminating synchronization overhead in software DSMs, developing new algorithms to handle situations found in practice. They evaluate the contributions of synchronization elimination algorithms based on 1) dependence analysis, 2) communication analysis, 3) exploiting coherence protocols in software DSMs, and 4) aggressive expansion of parallel SPMD regions. They also found suppressing expensive parallelism to be useful for one application. Experiments indicate these techniques eliminate almost all parallel task invocations, and reduce the number of barriers executed by 66% on average. On a 16 processor IBM SP-2, speedups are improved on average by 35%, and are tripled for some applications.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:0818684046
9780818684043
ISSN:1063-7133
DOI:10.1109/IPPS.1998.669997