We propose the design and an implementation of a bulk-parallel external memory priority
queue to take advantage of both shared-memory parallelism and high external memory
transfer speeds to parallel disks. To achieve higher performance by decoupling item
insertions and extractions, we offer two parallelization interfaces: one using “bulk”
sequences, the other by defining “limit” items. In the design, we discuss how to parallelize
insertions using multiple heaps, and how to calculate a dynamic prediction sequence to …

We present a priority queue implementation with support for external memory. The focus of
our work has been to derive a benefit from parallel sharedmemory machines. It's the first
parallel optimization of an external-memory priority queue. An additional bulk insertion
interface accelerates longer sequences of homogeneous operations, as they are more likely
to occur in applications that process large amounts of data. The algorithm will be available
as an extension to the Stxxl [6], a popular C++ template library for extra large data sets …