@inproceedings{ Fober:02b ,
title = {Lock-Free Techniques for Concurrent Access to Shared Objects},
author = {Dominique Fober and Stephane Letz and Yann Orlarey},
editor = {GMEM},
url = {fober-JIM2002.pdf},
year = {2002},
date = {2002-01-01},
booktitle = {Actes des Journées d’Informatique Musicale JIM2002, Marseille},
pages = {143–150},
abstract = {Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject of many works. Proposed solutions are commonly based on semaphores which have several drawbacks. For many cases, lock-free techniques constitute an alternate solution and avoid the disadvantages of semaphore based techniques. We present the principle of these lock-free techniques with the simple example of a LIFO stack. Then, based on Michael-Scott previous work, we propose a new algorithm to implements lock-free FIFO stacks with a simple constraint on the data structure.},
keywords = {access, computation, concurrent, lock-free, parallel, real-time},
pubstate = {published},
tppubtype = {inproceedings}
}
Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject of many works. Proposed solutions are commonly based on semaphores which have several drawbacks. For many cases, lock-free techniques constitute an alternate solution and avoid the disadvantages of semaphore based techniques. We present the principle of these lock-free techniques with the simple example of a LIFO stack. Then, based on Michael-Scott previous work, we propose a new algorithm to implements lock-free FIFO stacks with a simple constraint on the data structure.
