Priority queue operations on EREW-PRAM

Abstract

Using EREW-PRAM algorithms on a tournament based complete binary tree we implement the insert and extract-min operations with p = log IV processors at costs O(1) and O(log log N) respectively. Previous solutions [4, 7] under the PRAM model and identical assumptions attain O(log log N) cost for both operations. We also improve on constant factors the asymptotic bound for extract-min since in it we reduce the use of communication demanding primitives. The tournament tree enables the design of paraEel algorithms that are noticeably simple.