Paper Info
Title
Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems
Abstract
A mutual exclusion (ME) algorithm consists of a trying protocol (TP)and exit protocol (EP)that surround a critical section (CS)and satisfy the following properties: mutual exclusion: at most one process is allowed to use the CS at a given time; lockout freedom: any process that enters the TP eventually enters the CS; and bounded exit: a process can complete the EP in a bounded number of its own steps. A First-Come-First-Served (FCFS) ME algorithm [1] additionally requires processes to enter the CS in roughly the order in which they start the TP. Once a process has started executing the TP of a ME algorithm, it has committed itself to entering the CS, since the correctness of the algorithm may depend on every process properly completing its TP and EP.
Year
DOI
Venue
2008
10.1007/978-3-540-87779-0_41
DISC
Keywords
Field
DocType
bounded number,following property,me algorithm,local-spin algorithms,critical section,related problems,exit protocol,abortable mutual exclusion,bounded exit,lockout freedom,brief announcement,mutual exclusion,own step,satisfiability
Suzuki-Kasami algorithm,Spin-½,Computer science,Critical section,Correctness,Algorithm,Real-time computing,Mutual exclusion,Bounded function,Distributed computing
Conference
Citations 
PageRank 
References 
4
0.45
6
Authors
2
Name
Order
Citations
PageRank
Robert Danek1292.40
Hyonho Lee2121.63