Priority queues on parallel machines

We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one processor and MakeQueue, Insert, Meld, FindMin, ExtractMin, Delete and DecreaseKey in constant time with processors. A priority queue can be build in time with processors. A pipelined version of the priority queues adopt to a processor array of size , supporting the operations MakeQueue, Insert, Meld, FindMin, ExtractMin, Delete and DecreaseKey in constant time. By applying the k-bandwidth technique we get a data structure for the CREW PRAM which supports MultiInsertk operations in time and MultiExtractMink in time.

[1]  Rajeev Raman,et al.  Very fast optimal parallel algorithms for heap construction , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[2]  Gerth Stølting Brodal,et al.  Fast Meldable Priority Queues , 1995, WADS.

[3]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[5]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[6]  Sajal K. Das,et al.  O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube , 1998, J. Parallel Distributed Comput..

[7]  Paul F. Dietz.  Heap Construction in the Parallel Comparison Tree Model , 1992, SWAT.

[8]  Rolf Fagerberg,et al.  A Generalization of Binomial Queues , 1996, Inf. Process. Lett..

[9]  Szu-Tsung Cheng,et al.  Parallelism and locality in priority queues , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[10]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[11]  Weixiong Zhang,et al.  Building Heaps in Parallel , 1991, Inf. Process. Lett..

[12]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[13]  Sajal K. Das,et al.  Parallel and distributed meldable priority queues based on binomial heaps , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[14]  Robert E. Tarjan,et al.  Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.

[15]  Jesper Larsson Träff,et al.  A parallel priority data structure with applications , 1997, Proceedings 11th International Parallel Processing Symposium.

[16]  Geppino Pucci,et al.  Parallel Algorithms for Priority Queue Operations , 1995, Theor. Comput. Sci..

[17]  Gerth St lting Brodaly.  Worst-case Eecient Priority Queues , 1996 .

[18]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[19]  Kurt Mehlhorn,et al.  CHAPTER 6 – Data Structures , 1990 .

[20]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[21]  Thomas Strothotte,et al.  An Algorithm for Merging Heaps , 1985, Acta Informatica.

[22]  J. Ian Munro,et al.  An Implicit Binomial Queue with Constant Insertion Time , 1988, SWAT.

[23]  Gerth Stølting Brodal,et al.  Worst-case efficient priority queues , 1996, SODA '96.

[24]  Sajal K. Das,et al.  Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes , 1996, IEEE Trans. Parallel Distributed Syst..

[25]  Vipin Kumar,et al.  Concurrent Access of Priority Queues , 1988, IEEE Trans. Computers.

[26]  C. M. Khoong.  Optimal Parallel Construction of Heaps , 1993, Inf. Process. Lett..

[27]  Gerth Stølting Brodal.  Priority Queues on Parallel Machines , 1996, SWAT.

[28]  Geppino Pucci,et al.  Parallel Algorithms for Priority Queue Operations , 1992, SWAT.

[29]  Jean Vuillemin,et al.  A data structure for manipulating priority queues , 1978, CACM.

[30]  Geppino Pucci,et al.  Parallel Priority Queues , 1991, Inf. Process. Lett..

[31]  Clyde P. Kruskal,et al.  Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.