The weakest memory-access order
- 1 August 1992
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 15 (4) , 305-331
- https://doi.org/10.1016/0743-7315(92)90047-q
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problemMathematical Programming, 1988
- Efficient and correct execution of parallel programs that share memoryACM Transactions on Programming Languages and Systems, 1988
- On interprocess communicationDistributed Computing, 1986
- The mutual exclusion problemJournal of the ACM, 1986
- Axioms for memory access in asynchronous hardware systemsACM Transactions on Programming Languages and Systems, 1986
- Myths about the mutual exclusion problemInformation Processing Letters, 1981
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965