Automatic fence insertion for shared memory multiprocessing
- 23 June 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 285-294
- https://doi.org/10.1145/782814.782854
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Hiding relaxed memory consistency with a compilerIEEE Transactions on Computers, 2001
- Fixing the Java memory modelPublished by Association for Computing Machinery (ACM) ,1999
- Memory consistency and event ordering in scalable shared-memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1990
- Weak ordering---a new definitionPublished by Association for Computing Machinery (ACM) ,1990
- Efficient and correct execution of parallel programs that share memoryACM Transactions on Programming Languages and Systems, 1988
- Compiler Algorithms for SynchronizationIEEE Transactions on Computers, 1987
- On Reducing Data Synchronization in Multiprocessed LoopsIEEE Transactions on Computers, 1987
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979