This Article 
 Bibliographic References 
 Add to: 
Concurrent Access of Priority Queues
December 1988 (vol. 37 no. 12)
pp. 1657-1665
Contention for the shared heap limits the obtainable speedup in parallel algorithms using this data structure as a priority queue. An approach that allows concurrent insertions and deletions on the heap in a shared-memory multiprocessor is presented. The scheme retains the strict priority ordering of the serial-access heap algorithms, i.e. a delete operation returns the best key of all keys tha

[1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[2] M. J. Atallah and S. R. Kosaraju, "A generalized dictionary machine for VLSI,"IEEE Trans. Comput., vol. C-34, pp. 151-155, 1985.
[3] J. Biswas and J. C. Browne, "Simultaneous update of priority structures," inProc. Int. Conf. Parallel Processing, 1987, pp. 124- 131.
[4] W. J. Dally,A VLSI Architecture for Concurrent Data Structures. Boston, MA: Kluwer Academic, 1987, pp. 144-161.
[5] C. S. Ellis, "Concurrent search and insertion in 2-3 trees,"Acta Informatica, vol. 14, pp. 63-86, 1980.
[6] C. S. Ellis, "Concurrent search and insertion in avl trees,"IEEE Trans. Comput., vol. C-29, pp. 811-817, Sept. 1980.
[7] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[8] S.-rei Huang and L. Davis, "A tight upper bound for the speedup of parallel best-first branch-and-bound algorithms," Tech. Rep., Center Automat. Res., Univ. Maryland, College Park, 1987.
[9] V. Kumar, K. Ramesh, and V. Nageshwara Rao, "Parallel heuristic search of state-space graphs: A summary of results," inProc. 1988 Nat. Conf. Artif. Int., Aug. 1988. Also AI Lab Tech. Rep. 88-70, Univ. Texas, Austin, Mar. 1988.
[10] C. E. Leiserson,Area-Efficient VLSI Computation. Cambridge, MA: MIT Press, 1983.
[11] U. Manber and R. E. Ladner, "Concurrency control in a dynamic search structure,"ACM Trans. Database Syst., vol. 9, pp. 439-455, 1984.
[12] J. Mohan, "Experience with two parallel programs solving the traveling salesman problem," inProc. Int. Conf. Parallel Processing, 1983, pp. 191-193.
[13] V. Nageshwara Rao and V. Kumar, "Concurrent access of priority queues," Tech. Rep. TR88-06, Comput. Sci. Dep., Univ. Texas, Austin, Feb. 1988.
[14] V. N. Rao, V. Kumar, and K. Ramesh, "Parallel heuristic search on a shared memory multiprocessor," Tech. Rep. AI TR87-45, Univ. Texas, Austin, Jan. 1987.
[15] T. Ottman, A. Rosenberg, and L. J. Stockmeyer, "A dictionary machine for VLSI,"IEEE Trans. Comput., vol. C-31, pp. 892-897, 1982.
[16] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[17] M. J. Quinn and N. Deo, "Data structures for the efficient solution of graph theoretic problems on tightly-coupled MIMD computers," inProc. Int. Conf. Parallel Processing, 1984, pp. 431-438.
[18] M. J. Quinn and N. Deo, "Parallel graph algorithms,"ACM Comput. Surveys, vol. 16, pp. 319-348, Sept. 1984.
[19] M. J. Quinn and N. Deo, "An upper bound for the speedup of parallel branch-and-bound algorithms," Tech. Rep., Purdue Univ., Pullman, WA, 1984.
[20] A. Somani and V. Agarwal, "An unsorted dictionary machine for VLSI," inProc. 1984 Comput. Architecture Symp., 1984, pp. 142- 150.

Index Terms:
priority queues; shared heap; parallel algorithms; data structure; shared-memory multiprocessor; BBN Butterfly parallel processor; concurrent-heap algorithms; parallel branch-and-bound; multiprocessing systems; parallel algorithms; queueing theory.
R.V. Nageshwara, V. Kumar, "Concurrent Access of Priority Queues," IEEE Transactions on Computers, vol. 37, no. 12, pp. 1657-1665, Dec. 1988, doi:10.1109/12.9744
Usage of this product signifies your acceptance of the Terms of Use.