(h-k)-arbiter for h-out of-k Mutual Exclusion Problem

Authors:
Affiliations:
Venue:
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Year:
1999

Citing 0
Cited 4

An efficient distributed method for allocating resources based on an unobstructed squeezing technique

ACM SIGOPS Operating Systems Review
A Distributed h-out of -k Mutual Exclusion Algorithm for Ad Hoc Mobile Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A new self-stabilizing k-out-of-l exclusion algorithm on rings

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

h-out of-k mutual exclusion is a generalization of 1-mutual exclusion problem, where there are k units of shared resources and each process requests h(1 =