Distributed algorithms for multiple entries to a critical section with priority

Authors:
R. Baldoni;B. Ciciani
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1994

Citing 0
Cited 3

The congenial talking philosophers problem in computer networks

Distributed Computing
(h, k)-Arbiters for h-out-of-k mutual exclusion problem

Theoretical Computer Science
A class of high performance Maekawa-type algorithms for distributed systems under heavy demand

Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract