PARALLEL CONSTRUCTIONS OF HEAPS AND MIN-MAX HEAPS

Abstract

We study parallel solutions to the problem of implementing priority queues and priority deques. It is known that data structures for the implementation (e.g. the heap, the min-max heap, and the deap) can be constructed in linear sequential time. In this paper, we design optimal Θ(( log log n)2) time parallel algorithms with [Formula: see text] processors for the constructions in the parallel comparison tree model.