A compiler algorithm to reduce invalidation latency in virtual shared memory systems
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089795X,p. 248-257
- https://doi.org/10.1109/pact.1996.552673
Abstract
This paper presents a new compiler algorithm to eliminate invalidation traffic in virtual shared memory using a hybrid distributed invalidation scheme. It aggressively exploits static scheduling and data layout to accurately determine only those instances when invalidation is necessary, thus avoiding the additional read misses of previous schemes. Equations determining precisely what data should be invalidated are presented and followed by the derivation of approximations amenable to compiler manipulation. Compiler-directed invalidation in the presence of arbitrary control-flow is described and the definition of a compiler algorithm is presented. Preliminary experimental results on three programs show that this analysis can drastically reduce the amount of invalidation traffic and write misses.Keywords
This publication has 13 references indexed in Scilit:
- Dynamic self-invalidation: reducing coherence overhead in shared-memory multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Spinning-on-coherency: A new VSM optimisation for write-invalidatePublished by Springer Nature ,1996
- Compiler reduction of invalidation traffic in virtual shared memory systemsPublished by Springer Nature ,1996
- Synchronization Minimization in a SPMD Execution ModelJournal of Parallel and Distributed Computing, 1995
- Gated SSA-based demand-driven symbolic analysis for parallelizing compilersPublished by Association for Computing Machinery (ACM) ,1995
- Cooperative shared memoryACM Transactions on Computer Systems, 1993
- Cache coherence using local knowledgePublished by Association for Computing Machinery (ACM) ,1993
- Life span strategy---a compiler-based approach to cache coherencePublished by Association for Computing Machinery (ACM) ,1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Dataflow analysis of array and scalar referencesInternational Journal of Parallel Programming, 1991