Using elimination to implement scalable and lock-free FIFO queues

  • Authors:

  • Mark Moir;Daniel Nussbaum;Ori Shalev;Nir Shavit

  • Affiliations:

  • Sun Microsystems Laboratories, Burlington, MA;Sun Microsystems Laboratories, Burlington, MA;Sun Microsystems Laboratories, Burlington, MA and Tel Aviv University, Tel Aviv, Israel;Sun Microsystems Laboratories, Burlington, MA

  • Venue:
  • Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
  • Year:
  • 2005

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specifically, to linearizable FIFO queues. We show how to transform existing nonscalable FIFO queue implementations into scalable implementations using the elimination technique, while preserving lock-freedom and linearizablity.We apply our transformation to the FIFO queue algorithm of Michael and Scott, which is included in the Java™ Concurrency Package. Empirical evaluation on a state-of-the-art CMT multiprocessor chip shows that by using elimination as a backoff technique for the Michael and Scott queue algorithm, we can achieve comparable performance at low loads, and improved scalability as load increases.