Building Heaps in Parallel

We present O(log n) time parallel algorithms for constructing a heap of a set of n elements, chosen from a total order, using EREW PRAM and hypercube of at most [2n/log n] processors.

[1]  John P. Fishburn,et al.  Quotient Networks , 1982, IEEE Transactions on Computers.

[2]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[3]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[4]  Gaston H. Gonnet,et al.  Heaps on Heaps , 1982, SIAM J. Comput..

[5]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Bruce A. Reed,et al.  Building Heaps Fast , 1989, J. Algorithms.