First-Come-First-Served as a Separate Principle

A lock is a mechanism to guarantee mutual exclusion with eventual progress, i.e., some degree of fairness. First-come-first-served (FCFS) progress is perfectly fair. FCFS progress can be offered by a locking algorithm or added by wrapping a non-FCFS lock with a separate FCFS algorithm. A new separat...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on parallel computing 2024-11, Vol.11 (4), p.1-20, Article 16
Main Authors: Hesselink, Wim H., Buhr, Peter A., Parsons, Colby A.
Format: Article
Language:English
Subjects:
Computing methodologies
Concurrent algorithms
Parallel computing models
Shared memory algorithms
Theory of computation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!