An optimal parallel algorithm to construct a deap

Abstract

Recently, Carlsson [3] proposed a variation of the heap data structure as an efficient implementation of a double-ended priority queue. This new data structure is referred to as the deap. We show that constructing a deap with special properties can be done very easily, both sequentially and in parallel, by reducing the problem to selection and heap construction. Our parallel algorithm can be implemented to run in O(log n log ∗ n) time using an optimal number of processors in the EREW-PRAM model or in O(log n) time using an optimal number of processors in the CRCW model.