pith. sign in

arxiv: 1802.07504 · v2 · pith:Z6IU4UYInew · submitted 2018-02-21 · 💻 cs.DC

Skueue: A Scalable and Sequentially Consistent Distributed Queue

classification 💻 cs.DC
keywords skueuequeuetextscdistributedrequestshighmultipleoperations
0
0 comments X
read the original abstract

We propose a distributed protocol for a queue, called \textsc{Skueue}, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios. \textsc{Skueue} can be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue. Furthermore \textsc{Skueue} satisfies sequential consistency in the asynchronous message passing model. Scalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics. Operations in \textsc{Skueue} need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.