Relaxation for Efficient Asynchronous Queues
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916642394472448 |
|---|---|
| author | Baldwin, Samuel Hausman, Cole Bakr, Mohamed Talmage, Edward |
| author_facet | Baldwin, Samuel Hausman, Cole Bakr, Mohamed Talmage, Edward |
| contents | We explore the problem of efficiently implementing shared data structures in an asynchronous computing environment. We start with a traditional FIFO queue, showing that full replication is possible with a delay of only a single round-trip message between invocation and response of each operation. This is optimal, or near-optimal, runtime for the Dequeue operation. We then consider ways to circumvent this limitation on performance. Though we cannot improve the worst-case time per operation instance, we show that relaxation, weakening the ordering guarantees of the Queue data type, allows most Dequeue instances to return after only local computation, giving a low amortized cost per instance. This performance is tunable, giving a customizable tradeoff between the ordering of data and the speed of access |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_02164 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Relaxation for Efficient Asynchronous Queues Baldwin, Samuel Hausman, Cole Bakr, Mohamed Talmage, Edward Distributed, Parallel, and Cluster Computing C.2.4; E.1; F.2.0 We explore the problem of efficiently implementing shared data structures in an asynchronous computing environment. We start with a traditional FIFO queue, showing that full replication is possible with a delay of only a single round-trip message between invocation and response of each operation. This is optimal, or near-optimal, runtime for the Dequeue operation. We then consider ways to circumvent this limitation on performance. Though we cannot improve the worst-case time per operation instance, we show that relaxation, weakening the ordering guarantees of the Queue data type, allows most Dequeue instances to return after only local computation, giving a low amortized cost per instance. This performance is tunable, giving a customizable tradeoff between the ordering of data and the speed of access |
| title | Relaxation for Efficient Asynchronous Queues |
| topic | Distributed, Parallel, and Cluster Computing C.2.4; E.1; F.2.0 |
| url | https://arxiv.org/abs/2503.02164 |