Title of article
Queue based mutual exclusion with linearly bounded overtaking
Author/Authors
Wim H. Hesselink، نويسنده , , Alex A. Aravind، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
13
From page
542
To page
554
Abstract
The queue based mutual exclusion protocol establishes mutual exclusion for threads by means of not necessarily atomic variables. In order to enter the critical section, a competing thread needs to traverse as many levels as there are currently competing threads. Competing threads can be overtaken by other competing threads. It is proved here, however, that every competing thread is overtaken less than times, and that the overtaking threads were competing when the first one of them exits.
Keywords
Refinement , Mutual exclusion , shared memory , Bounded overtaking , Verification
Journal title
Science of Computer Programming
Serial Year
2011
Journal title
Science of Computer Programming
Record number
1080194
Link To Document