Design and analysis of simultaneous access priority queues

A simultaneous access priority queue design which handles p accesses every O(logp) time is presented. A processor is free to perform another task after issuing an insert, whereas it has to wait O(log p) time to receive the response of a delete-min. Compared with all sequential access designs which require O(p) time to process p accesses, our design achieves a significant performance improvement. For a fixed number of priorities, we propose a design which can pipeline accesses in constant time. For both designs, the strict highest-priority-out-first property is maintained.