Rao-and-Kumar’s concurrent heap [7] is extracted from the serial heap, and the parallel heap has evolved from concurrent heap, to a certain extent. Also, all three heaps use the array data structure with its implicit binary tree representation without using any pointers. Thus, they constitute an appropriate collection to be experimented with in search for a fast and practical priority queue