A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem

Authors:
Kumiko Obokata;Michiko Omori;Kazuhiro Motegi;Yoshihide Igarashi
Affiliations:
-;-;-;-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 5
Cited 0

Bounded concurrrent time-stamp systems are constructible

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A bounded first-in, first-enabled solution to the l-exclusion problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms

Distributed Algorithms
Resource allocation with immunity to limited process failure

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a lockout avoidance algorithm for the k-exclusion problem on the asynchronous multi-writer/reader shared memory model. This algorithm is the extension of an accelerated version of the n-process algorithm to the k-exclusion problem. The running time by the algorithm for the trying region of any faultless process is bounded by (n - k)c + O(n(n - k)2)l if the number of stopping process failures is less than k, where n is the number of processes, l is an upper bound on the time between two successive atomic steps for any faultless process, and c is an upper bound on the time that any user spends in the criticalregion.