Skip to main content
SpringerLink
Log in

Parallel Algorithms and Complexity

  • Chapter
Parallel Computing in Optimization

Part of the book series: Applied Optimization ((APOP,volume 7))

  • 336 Accesses

Abstract

From a practical point of view, the first stage towards efficient parallel algorithms is to observe that many sequential algorithms contain huge numbers of statements that can be scheduled for parallel execution. This chapter deals with the next stage. When standard sequential algorithms don’t allow sufficient parallelism, then parallel algorithms based on new design principles are needed. For many fundamental graph problems, such new parallel algorithms have been developed over the past two decades.

The purpose of this chapter is first to introduce the most successful models of parallel computation suitable for massive parallelism, and second to present an introduction to methods that solve basic tasks and can therefore be used as subroutines in many discrete optimization problems. Often, the solutions are work-optimal and reasonably simple to become quite practiced. At the same time, some other examples are presented to exhibit more advanced tools and to indicate the boundary, where these second stage methods might not yet produce practical solutions, or where even the theoretical solvability is in doubt.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, Mass., 1974.

    MATH  Google Scholar 

  2. S. G. Akl, The design and analysis of parallel algorithms, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.

    MATH  Google Scholar 

  3. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7 (1986), 567–583.

    Article  MathSciNet  MATH  Google Scholar 

  4. K. Appel and W. Haken, Every planar map is four-colorable, Illinois J. Math. 21 (1977), 429–567.

    MathSciNet  MATH  Google Scholar 

  5. K. Appel, W. Haken, and J. Koch, Every planar map is four colorable: Part 2, reducibility, Illinois Journal of Mathematics 21 (1977), 491–567.

    MathSciNet  MATH  Google Scholar 

  6. B. Awerbuch, A. Israeli, and Y. Shiloach, Finding Euler circuits in logarithmic parallel time, Advances in Computing Research; Parallel and Distributed Computing (F. P. Preparata, ed.), vol. 4, JAI Press Inc., Greenwich, CT — London, 1987, pp. 69–78.

    Google Scholar 

  7. S. Baase, Introduction to Parallel Connectivity, List Ranking, and Euler Tour Techniques, ch. 2, pp. 61–114, Synthesis of Parallel Algorithms, J. H. Reif (Editor), M. Kaufmann, San Mateo, Calif., 1993.

    Google Scholar 

  8. R. P. Brent, The parallel evaluation of general arithmetic expressions, J. ACM 21 (1974), 201–206.

    Article  MathSciNet  MATH  Google Scholar 

  9. F. Y. Chin, J. Lam, and I. Chen, Efficient parallel algorithms for some graph problems, Commun. ACM 25 (1982), no. 9, 659–665.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. Cole and U. Vishkin, Approximate parallel scheduling. I. The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput. 17 (1988), 128–142.

    MathSciNet  MATH  Google Scholar 

  11. S. A. Cook, Towards a complexity theory of synchronous parallel computation, Enseign. Math. 27 (1981), 99–124.

    MathSciNet  MATH  Google Scholar 

  12. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, MIT Press and McGraw-Hill, Cambridge, Mass. and New York, 1990.

    MATH  Google Scholar 

  13. S. Fortune and J. Wyllie, Parallelism in random access machines, Proceedings of the 10th Ann. ACM Symposium on Theory of Computing ( San Diego, Calif. ), 1978, pp. 114–118.

    Google Scholar 

  14. M. Fürer and B. Raghavachari, An NC approximation algorithm for the minimum degree spanning tree problem, Proceedings of the 28th Annual Allerton Conf. on Communication, Control and Computing, 1990, pp. 274– 281.

    Google Scholar 

  15. M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, Journal of Algorithms 17 (1994), 409–423.

    Article  MathSciNet  Google Scholar 

  16. M. R. Garey, D. S. Johnson, and I. Stockmeyer, Some simplified NP- complete graph problems, Theoretical Computer Science 1 (1976), 237–267.

    Article  MathSciNet  MATH  Google Scholar 

  17. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, 1979.

    MATH  Google Scholar 

  18. A. Gibbons and W. Rytter, Efficient parallel algorithms, Cambridge University Press, Cambridge, 1988.

    MATH  Google Scholar 

  19. J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6 (1977), 675–695.

    Article  MathSciNet  MATH  Google Scholar 

  20. L. M. Goldschlager, The monotone and planar circuit value problems are logspace complete for P, SIGACT News 9 (1977), 25–29.

    Article  Google Scholar 

  21. L. M. Goldschlager, R. A. Shaw, and J. Staples, The maximum flow problem is logspace complete for P, Theoretical Computer Science 21 (1982), 105–111.

    Article  MathSciNet  MATH  Google Scholar 

  22. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, Computing connected components on parallel computers, Commun. ACM 22 (1979), no. 8, 461– 464.

    Google Scholar 

  23. D.S. Hirschberg, Parallel algorithms for the transitive closure and the connected component problems, Proceedings of the 8th Ann. ACM Symposium on Theory of Computing ( Hershey, PA ), ACM Press (New York), 1976, pp. 55–57.

    Google Scholar 

  24. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981), 718–720.

    Article  MathSciNet  MATH  Google Scholar 

  25. A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matching, Inf. Process. Lett. 22 (1986), no. 2, 57–60.

    Article  MathSciNet  MATH  Google Scholar 

  26. J. JaJa, An introduction to parallel algorithms, Addison-Wesley, Reading, Mass., 1992.

    MATH  Google Scholar 

  27. R. M. Karp and V. Ramachandran, Parallel Algorithms for Shared- Memory Machines, vol. A, Algorithms and Complexity, ch. 17, pp. 869– 941, Handbook of Theoretical Computer Science, J. van Leeuwen (Editor), Elsevier and MIT Press, New York and Cambridge, Mass., 1990.

    Google Scholar 

  28. R. M. Karp, E. Upfal, and A. Wigderson, Constructing a perfect matching is in random NC, Combinatorica 6 (1986), 35–48.

    Article  MathSciNet  MATH  Google Scholar 

  29. R.M. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, J. ACM 32 (1985), no. 4, 762–773.

    Article  MathSciNet  MATH  Google Scholar 

  30. R. E. Ladner, The circuit value problem is log space complete for P, SIGACT News 7 (1975), 18–20.

    Article  Google Scholar 

  31. R. E. Ladner and M. J. Fischer, Parallel prefix computation, J. ACM 27 (1980), 831–838.

    Article  MathSciNet  MATH  Google Scholar 

  32. F. T. Leighton, Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Mateo, Calif., 1992.

    MATH  Google Scholar 

  33. G. F. Lev, N. Pippenger, and L. G. Valiant, A fast parallel algorithm for routing in permutation networks, IEEE Trans. Comput. C-30 (1981), no. 2, 93–100.

    MathSciNet  Google Scholar 

  34. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput. 15 (1986), 1036–1053.

    Article  MathSciNet  MATH  Google Scholar 

  35. C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization, Algorithms and complexity, Prentice-Hall, Englewood Cliffs, New Jersey, 1982.

    Google Scholar 

  36. M.J. Quinn, Parallel computing, theory and practice, second ed., McGraw- Hill Inc., New York, 1994.

    Google Scholar 

  37. J. H. Reif (Editor), Synthesis of parallel algorithms, M. Kaufmann, San Mateo, Calif., 1993.

    Google Scholar 

  38. H. S. Stone, Parallel tridiagonal equation solvers, ACM Transactions on Mathematical Software 1 (1975), 289–307.

    Article  MATH  Google Scholar 

  39. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985), 862–874.

    Article  MathSciNet  MATH  Google Scholar 

  40. V.G. Vizing, On an estimate of the chromatic class of a p-graph (Russian), Diskret. Anal. 3 (1964), 25–30.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Pennsylvania State University, 220 Pond Laboratory,University Park, Pennsylvania, 16802-6106, USA

    Martin Fürer

Authors
  1. Martin Fürer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Optimization, Department of Mathematics, Linköping Institute of Technology, S-581 83, Linköping, Sweden

    Athanasios Migdalas

  2. Department of Industrial and Systems Engineering, University of Florida, FL32611, Gainesville, USA

    Panos M. Pardalos

  3. Department of Informatics, University of Bergen, Thormøhlensgate 55, N-5020, Bergen, Norway

    Sverre Storøy

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Kluwer Academic Publishers

About this chapter

Cite this chapter

Fürer, M. (1997). Parallel Algorithms and Complexity. In: Migdalas, A., Pardalos, P.M., Storøy, S. (eds) Parallel Computing in Optimization. Applied Optimization, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3400-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3400-2_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3402-6

  • Online ISBN: 978-1-4613-3400-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation