A Faster External Memory Priority Queue with DecreaseKeys

06/20/2018
by   Shunhua Jiang, et al.
0

A priority queue is a fundamental data structure that maintains a dynamic set of (key, priority)-pairs and supports Insert, Delete, ExtractMin and DecreaseKey operations. In the external memory model, the current best priority queue supports each operation in amortized O(1/BN/B) I/Os. If the DecreaseKey operation does not need to be supported, one can design a more efficient data structure that supports the Insert, Delete and ExtractMin operations in O(1/BN/B/ M/B) I/Os. A recent result shows that a degradation in performance is inevitable by proving a lower bound of Ω(1/B B/ N) I/Os for priority queues with DecreaseKeys. In this paper we tighten the gap between the lower bound and the upper bound by proposing a new priority queue which supports the DecreaseKey operation and has an expected amortized I/O complexity of O(1/BN/B/ N). Our result improves the external memory priority queue with DecreaseKeys for the first time in over a decade, and also gives the fastest external memory single source shortest path algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2019

A parallel priority queue with fast updates for GPU architectures

The high computational throughput of modern graphics processing units (G...
research
03/07/2019

External memory priority queues with decrease-key and applications to graph algorithms

We present priority queues in the external memory model with block size ...
research
05/08/2019

Algorithms for Grey-Weighted Distance Computations

With the increasing size of datasets and demand for real time response f...
research
01/10/2018

Neural Program Synthesis with Priority Queue Training

We consider the task of program synthesis in the presence of a reward fu...
research
12/07/2016

An Infinite Dimensional Model for a Many Server Priority Queue

We consider a Markovian many server queueing system in which customers a...
research
09/02/2021

Multi-Queues Can Be State-of-the-Art Priority Schedulers

Designing and implementing efficient parallel priority schedulers is an ...
research
04/28/2023

MCPrioQ: A lock-free algorithm for online sparse markov-chains

In high performance systems it is sometimes hard to build very large gra...

Please sign up or login with your details

Forgot password? Click here to reset