Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Armando Castañeda and Miguel Piña. Fully Read/Write Fence-Free Work-Stealing with Multiplicity. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 16:1-16:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{castaneda_et_al:LIPIcs.DISC.2021.16, author = {Casta\~{n}eda, Armando and Pi\~{n}a, Miguel}, title = {{Fully Read/Write Fence-Free Work-Stealing with Multiplicity}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {16:1--16:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.16}, URN = {urn:nbn:de:0030-drops-148181}, doi = {10.4230/LIPIcs.DISC.2021.16}, annote = {Keywords: Correctness condition, Linearizability, Nonblocking, Relaxed data type, Set-linearizability, Wait-freedom, Work-stealing} }
Feedback for Dagstuhl Publishing