Relaxation for Efficient

Relaxation for Efficient
Relaxation for Efficient Asynchronous Queues

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. Th…