A distributed synchronization mechanism for interacting processes

Authors:
W. C. Yen;K. S. Fu
Affiliations:
School of Electrical Engineering, Purdue University, West Lafayette, IN 47907, U.S.A.;School of Electrical Engineering, Purdue University, West Lafayette, IN 47907, U.S.A.
Venue:
Computer Languages
Year:
1983

Citing 11
Cited 0

Concurrent Programming Concepts

ACM Computing Surveys (CSUR)
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Synchronization with eventcounts and sequencers

Communications of the ACM
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Further comments on Dijkstra's concurrent programming control problem

Communications of the ACM
Concurrent control with “readers” and “writers”

Communications of the ACM
Operating system principles

Operating system principles
Analysis of multiprocessor cache organizations with alternative main memory update policies

ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Economical solutions for the critical section problem in a distributed system (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A new solution to the critical section problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The mutual exclusion problem for unreliable processes

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reliable synchronization is intended to ensure a graceful degradation of the system in the event of a failure. Solutions to synchronization problems of this kind under constant space conditions are presented. Lamport's bakery algorithm and generalized critical region have been modified and extended for application to this problem.