JHeaps: An open-source library of priority queues
Several new heap variants have been introduced in the last two decades. The main research motivation is to match the in-practice performance of pairing heaps while at the same time providing the strong theoretical guarantees of the original fibonacci heap. We present the interface and design of the...
Main Author: | Dimitrios Michail |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2021-12-01
|
Series: | SoftwareX |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2352711021001370 |
Similar Items
-
QUEUEING DISCIPLINES BASED ON PRIORITY MATRIX
by: Taufik I. Aliev, et al.
Published: (2014-11-01) -
Efficiency of Priority Queue Architectures in FPGA
by: Lukáš Kohútka
Published: (2022-07-01) -
The M/G/1 queueing model with preemptive random priorities
by: Moshe Haviv
Published: (2015-11-01) -
An N Server Cutoff Priority Queue Where Customers Request a Random Number of Servers
by: Schaack, Christian, et al.
Published: (2004) -
Evaluation of the traffic coefficient in priority queueing systems
by: Gh. Mishkoy, et al.
Published: (2008-07-01)