An empirical comparison of priority-queue and event-set implementations

Abstract

Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.