Leslie Lamport
Abstract
The problem of sharing data among asynchronous processes is considered. It is assumed that only one process at a time can modify the data, but concurrent reading and writing is permitted. Two general theorems are proved, and some algorithms are presented to illustrate their use. These include a solution to the general problem in which a read is repeated if it might have obtained an incorrect result, and two techniques for transmitting messages between processes. These solutions do not assume any synchronizing mechanism other than data which can be written by one process and read by other processes.
- 1 Brinch Hansen, P. A comparison of two synchronizing concepts. Acta lnformatica 1, 3 (1972), 190-199.Google Scholar
- 2 Brinch Hansen, P, Concurrent programming concepts. Computing Surveys 5, 4 (Dec. 1973), 223-245. Google ScholarDigital Library
- 3 Courtois, P.J., Heymans, F., and Parnas, D.L. Concurrent control with "readers" and "writers." Comm. ACM 14, 10 (Oct. 1971), 667-668. Google ScholarDigital Library
- 4 Easton, W.B. Process synchronization without long-term interlock. Proc. Third ACM Symp. on Operating System Principles, Operating Syst. Rev. (ACM) 6, 1 and 2 (June 1972), 95-100. Google ScholarDigital Library
- 5 Lamport, L. A new solution of Dijkstra's concurrent programming problem. Comm. ACM 17, 8 (Aug. 1974), 453-455. Google ScholarDigital Library
- 6 Lamport, L. Proving the correctness of multiprocess programs. 1EEE Trans. on Software Engineering SE-3 , 2 (Mar. 1977), 125- 143.Google ScholarDigital Library
- 7 Schaefer, M. Quasi-synchronization of readers and writers in a secure multi-level environment. TM-5407/003, System Development Corp., Santa Monica, Calif., Sept. 1974.Google Scholar
- 8 White, J.C.C. Design of a secure file management system. MTR-2931, The Mitre Corp., Bedford, Mass., June 1974.Google Scholar
Recommendations
Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks
We give a probabilistic model for conflicts among transactions in a database. We extend recent work (Mitra and Weinberger, J. Assoc. Comput. Mach., 31 (1984), pp. 855–878) by allowing two kinds of locks for concurrency control, exclusive and non-...
Concurrent reading while writing II: The multi-writer case
SFCS '87: Proceedings of the 28th Annual Symposium on Foundations of Computer ScienceAn algorithm is given for the multi-writer version of the Concurrent Reading While Writing (CRWW) problem. The algorithm solves the problem of allowing simultaneous access to arbitrarily sized shared data without requiring waiting, and hence avoids ...
A Concurrency Measure
With the new advents of technology and the availability of microprocessors and minicomputers, parallel and distributed processing is gaining widespread acceptability. In such systems resources are shared among a number of processes. Accesses to the ...
Comments