Two-enqueuer queue in Common2
| dc.creator | Eisenstat, David | |
| dc.date | 2008-05-04 | |
| dc.date | 2009-04-07 | |
| dc.date.accessioned | 2026-07-07T13:00:29Z | |
| dc.date.available | 2026-07-07T13:00:29Z | |
| dc.description | The question of whether all shared objects with consensus number 2 belong to Common2, the set of objects that can be implemented in a wait-free manner by any type of consensus number 2, was first posed by Herlihy. In the absence of general results, several researchers have obtained implementations for restricted-concurrency versions of FIFO queues. We present the first Common2 algorithm for a queue with two enqueuers and any number of dequeuers. | |
| dc.identifier | https://arxiv.org/abs/0805.0444 | |
| dc.identifier | http://arxiv.org/abs/0805.0444 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/225854 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.title | Two-enqueuer queue in Common2 | |
| dc.type | text |