A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention

  • Jonatan Lindén
  • Bengt Jonsson
Conference paper

DOI: 10.1007/978-3-319-03850-6_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8304)
Cite this paper as:
Lindén J., Jonsson B. (2013) A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. In: Baldoni R., Nisse N., van Steen M. (eds) Principles of Distributed Systems. OPODIS 2013. Lecture Notes in Computer Science, vol 8304. Springer, Cham

Abstract

Priority queues are fundamental to many multiprocessor applications. Several priority queue algorithms based on skiplists have been proposed, as skiplists allow concurrent accesses to different parts of the data structure in a simple way. However, for priority queues on multiprocessors, an inherent bottleneck is the operation that deletes the minimal element. We present a linearizable, lock-free, concurrent priority queue algorithm, based on skiplists, which minimizes the contention for shared memory that is caused by the DeleteMin operation. The main idea is to minimize the number of global updates to shared memory that are performed in one DeleteMin. In comparison with other skiplist-based priority queue algorithms, our algorithm achieves a 30 - 80% improvement.

Keywords

Concurrent Data Structures Priority Queue Lock-free Non-blocking Skiplist 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Jonatan Lindén
    • 1
  • Bengt Jonsson
    • 1
  1. 1.Department of Information TechnologyUppsala UniversityUppsalaSweden

Personalised recommendations