Skip to main content
SpringerLink
Log in

Data Structures for Parallel Computation on Shared-Memory Machines

  • Conference paper
Supercomputing

Part of the book series: NATO ASI Series ((NATO ASI F,volume 62))

Abstract

One of the major bottlenecks in developing parallel algorithms is the lack of “parallel data structures,” particularly for nonnumerical and seminumerical problems. Many of the traditional data structures that have served so well in sequential computing do not easily lend themselves to parallel processing, hi this paper we develop three practical paradigms for designing parallel data structures in a shared-memory environment and illustrate them through parallelization of a queue, a stack, and a heap. Other related structures are also discussed.

This work was supported by a research contract (#N61339-88-G-0002) from the U.S. Army’s PM-TRADE, and by a research grant from Florida High Technology and Industry Council.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bar-On, I., and Vishkin, U., “Optimal Parallel Generation of a Computation Tree Form”, ACM Trans. on Prog. Lang. and Systems, 7, pp. 348–357, 1985.

    Article  MATH  Google Scholar 

  2. Berkman, O., Breslauer, D., Galil, Z., Schieber, B., and Vishkin, U., “Highly Parallelizable Problems”, Proc. 21st ACM Symp. on Theory of Computing, 1989.

    Google Scholar 

  3. Bilardi, G., and Nicolau, A., “Adaptive Bitonic Sorting: an Optimal Algorithm for Shared-Memory Machines”, SI AM J. Compute 18, pp. 216–228, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  4. Biswas, J., and Browne, J. C., “Simultaneous Update of Priority Structures”, Proc. Int. Conf. Parallel Process., pp. 124–131, 1987.

    Google Scholar 

  5. Brent, R. P., “The Parallel Evaluation of General Arithmetic Expressions”, J. ACM, 21, pp. 201–206, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  6. Cole, R., “Parallel Merge Sort”, SIAM J. Compute 17, pp. 770–785, 1988.

    Article  MATH  Google Scholar 

  7. Deo, N., Pang, C. Y., and Lord, R. E., “Two Parallel Algorithms for Shortest Path Problems”, Proc. Int. Conf. on Parallel Processpp. 244–253, 1980.

    Google Scholar 

  8. Deo, N., and Prasad, S., “Parallel Heap”, Technical Report No. CS-TR-89-10, Dept. of Computer Science, University of Central Florida, Orlando, FL, 1989.

    Google Scholar 

  9. Dekel, E, and Sahni, S., “Parallel Generation of Postfix and Tree Forms”, ACM Trans, on Prog. Languages and Systems 5, pp. 300–317, 1983.

    Article  MATH  Google Scholar 

  10. Ellis, C. S., “Distributed Data Structures”, IEEE Trans. Comput., 34, pp. 1178–1185, 1985.

    Google Scholar 

  11. Jones, D. W., “Concurrent Operations on Priority Queues”, Comm. ACM, 32, pp. 132–137, 1989.

    Article  MathSciNet  Google Scholar 

  12. Manber, U., “Concurrent Maintenance of Binary Search Trees”, IEEE Trans. Softw. Engg., SE-10, pp. 777–784, 1984.

    Article  Google Scholar 

  13. Mohan, J., “Experience With Two Parallel Programs Solving the Traveling Salesman Problem”, Proc. Int. Conf. Parallel Process., pp. 191–193, 1983.

    Google Scholar 

  14. Muller, D. E., and Preparata, F. P., “Bounds to Complexities of Net-works for Sorting and for Switching”, J. ACM, 22 (2), pp. 195–201, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  15. Quinn, M. J., and Yoo, Y. B., “Data Structure for the Efficient Solution of Graph Theoretic Problems on Tightly-Coupled MIMD Computers”, Proc. Int. Conf. Parallel Process., pp. 431–438, 1984.

    Google Scholar 

  16. Quinn, M. J., “The Design and Analysis of Algorithms and Data Structures for the Efficient Solution of Graph Theoretic Problems on MIMD Computers”, Ph.D. Dissertation, Computer Science Dept., Washington State University, Pullman, WA, 1983.

    Google Scholar 

  17. Quinn, M. J., and Deo, N., “Parallel Graph Algorithms”, ACM Computing Surveys, 16, pp. 319–348, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  18. Rao, V. N., and Kumar, V., “Concurrent Access of Priority Queues”, IEEE Trans. Comput., 37, pp. 1657–1665, 1988.

    Article  MATH  Google Scholar 

  19. Reingold, E. M., Nievergelt, J., and Deo, N., Combinatorial Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1977.

    Google Scholar 

  20. Sarkar, D., and Deo, N., “Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses”, Proc. Int. Conf. on Super computing, Springer-Verlag LNCS, Vol. 297, pp. 970–984, 1987.

    Google Scholar 

  21. Syslo, M. ML, Deo, N., and Kowalik, J. S., Discrete Optimization Algorithms with Pascal Programs, Prentice-Hall, Englewood Cliffs, NJ, 1983.

    MATH  Google Scholar 

  22. Wyllie, J. C., “The Complexity of Parallel Computation”, Ph. D. Dissertation, TR 79-387, Dept. of Computer Science, Cornell University, Ithaca, NY, 1979.

    Google Scholar 

  23. Yoo, Y. B., “Parallel Processing for Some Network Optimization Problems”, Ph.D. Dissertation, Computer Science Dept., Washington State University, Pullman, WA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Central Florida, Orlando, Florida, 32816, USA

    Narsingh Deo

Authors
  1. Narsingh Deo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineering Computing and Analysis, Boeing Computer Services, P.O. Box 24346, Seattle, WA, 98124, USA

    Janusz S. Kowalik

  2. Department of Computer Science and Engineering, University of Washington, Seattle, WA, 98195, USA

    Janusz S. Kowalik

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deo, N. (1990). Data Structures for Parallel Computation on Shared-Memory Machines. In: Kowalik, J.S. (eds) Supercomputing. NATO ASI Series, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75771-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-75771-6_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-75773-0

  • Online ISBN: 978-3-642-75771-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation