Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2018.3
URN: urn:nbn:de:0030-drops-95415
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9541/
van Glabbeek, Rob
Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk)
| pdf-format: |
|
Abstract
A mutual exclusion algorithm is called speed independent if its correctness does not depend on the relative speed of the components. Famous mutual exclusion protocols such as Dekker's, Peterson's and Lamport's bakery are meant to be speed independent.In this talk I argue that speed-independent mutual exclusion may not be implementable on standard hardware, depending on how we believe reading and writing to a memory location is really carried out. It can be implemented on electrical circuits, however.
This builds on previous work showing that mutual exclusion cannot be accurately modelled in standard process algebras.
BibTeX - Entry
@InProceedings{vanglabbeek:LIPIcs:2018:9541,
author = {Rob van Glabbeek},
title = {{Is Speed-Independent Mutual Exclusion Implementablel (Invited Talk)}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Sven Schewe and Lijun Zhang},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9541},
URN = {urn:nbn:de:0030-drops-95415},
doi = {10.4230/LIPIcs.CONCUR.2018.3},
annote = {Keywords: Mutual exclusion, speed independence, concurrent reading and writing, liveness, justness}
}
| Keywords: | Mutual exclusion, speed independence, concurrent reading and writing, liveness, justness | |
| Seminar: | 29th International Conference on Concurrency Theory (CONCUR 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 31.08.2018 |
