|
ABSTRACT
Synchronization of concurrent processes requires controlling the relative ordering of events in the processes. A new synchronization mechanism is proposed, using abstract objects called eventcounts and sequencers, that allows processes to control the ordering of events directly, rather than using mutual exclusion to protect manipulations of shared variables that control ordering of events. Direct control of ordering seems to simplify correctness arguments and also simplifies implementation in distributed systems. The mechanism is defined formally, and then several examples of its use are given. The relationship of the mechanism to protection mechanisms in the system is explained; in particular, eventcounts are shown to be applicable to situations where confinement of information matters. An implementation of eventcounts and sequencers in a system with shared memory is described.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Bell, D.E., and LaPadula, L.J. Secure computer systems: A mathematical model. Air Force Electr. Systs. Div. Rcp. ESD-TR-73- 278, Vol. II, Nov. 1973.
|
 |
2
|
|
 |
3
|
|
 |
4
|
|
| |
5
|
Dijkstra, E. W. Cooperating sequential processes. In Programming Languages, F. Genuys, Ed., Academic Press, New York, 1968.
|
| |
6
|
Dijkstra, E. W. Hierarchical ordering of sequential processes. Acta Informatica 1 (1970, 115-138.
|
 |
7
|
|
| |
8
|
Greff, I. Semantics of communicating parallel processes. M.I.T. Proj. MAC TR-154, Sept. 1975.
|
 |
9
|
|
 |
10
|
|
 |
11
|
|
| |
12
|
Kanodia, R. K., and Reed, D. P. Synchronization in distributed systems. In Preparation.
|
| |
13
|
|
 |
14
|
|
| |
15
|
Lamport, L. Synchronization of independent processes. Acta Informatica 7, 1 (1976), 15-34.
|
 |
16
|
|
 |
17
|
|
 |
18
|
|
| |
19
|
Patti, S. S. Limitations and capabilities of Dijkstra's semaphore primitives for coordination among processes. M.I.T. Proj. MAC Computational Structures Group Memo 57, Feb. 1971.
|
| |
20
|
|
| |
21
|
Schaefer, M. Quasi-synchronization of readers and writers in a secure multi-level environment. Syst. Develop. Corp. TM-5407/003, Sept. 1974.
|
CITED BY 44
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Nicolas Vidot , Michelle Cart , Jean Ferrié , Maher Suleiman, Copies convergence in a distributed real-time collaborative environment, Proceedings of the 2000 ACM conference on Computer supported cooperative work, p.171-180, December 2000, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Kunle Olukotun , Mark Heinrich , David Ofelt, Digital system simulation: methodologies and examples, Proceedings of the 35th annual conference on Design automation, p.658-663, June 15-19, 1998, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
Kathryn Heninger Britton , R. Alan Parker , David L. Parnas, A procedure for designing abstract interfaces for device interface modules, Proceedings of the 5th international conference on Software engineering, p.195-204, March 09-12, 1981, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
James E. Lumpp , Kuppuswamy Sivakumar , Christopher Diaz , James N. Griffioen, Performance visualization for distributed shared memory systems, Virtual shared memory for distributed architectures, Nova Science Publishers, Inc., Commack, NY, 2001
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Cynthia E. Irvine , Timothy E. Levin , Paul C. Clark , Thuy D. Nguyen, A security architecture for transient trust, Proceedings of the 2nd ACM workshop on Computer security architectures, October 31-31, 2008, Alexandria, Virginia, USA
|
|
|
|
|
|
|
|