Skip to main content
SpringerLink
Log in
Book cover

Guide to Graph Algorithms pp 77–115Cite as

Parallel Graph Algorithms

  • Chapter
  • First Online:

Part of the book series: Texts in Computer Science ((TCS))

Abstract

We investigate methods for parallel algorithm design with emphasis on graph algorithms in this chapter. Shared memory and distributed memory parallel processing are the two fundamental models at hardware, operating system, programming, and algorithmic levels of parallel computation. We review these methods and describe static and dynamic load balancing in parallel computing systems.

This is a preview of subscription content, 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 EPUB and 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
Hardcover Book
USD   84.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

Learn about institutional subscriptions

References

  1. Belloch G (2015) Algorithm design: parallel and sequential, Draft book

    Google Scholar 

  2. http://www.nvidia.com/object/cuda_home_new.html

  3. Flynn MJ (1972) Some computer organizations and their effectiveness. IEEE Trans. Comput. C21(9):948960

    MATH  Google Scholar 

  4. Foster I (1995) Designing and building parallel programs: concepts and tools for parallel software engineering. Addison-Wesley, Boston

    MATH  Google Scholar 

  5. Gantt HL (1910) Work, wages and profit, The engineering magazine, New York

    Google Scholar 

  6. Grama A, Karypis G, Kumar V, Gupta A (2003) Introduction to parallel computing, 2nd edn. Addison-Wesley, Boston

    MATH  Google Scholar 

  7. Karypis G, Kumar V (1995) Multilevel k-way partitioning scheme for irregular graphs. Technical Report TR 95-064, Department of Computer Science, University of Minnesota

    Google Scholar 

  8. Karypis G, Kumar V (1997) A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm. In: 8th SIAM conference on parallel processing for scientific computing

    Google Scholar 

  9. Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291307

    Article  Google Scholar 

  10. http://www.mcs.anl.gov/research/projects/mpi/

  11. http://www.open-mpi.org/

  12. http://openmp.org/wp/

  13. POSIX.1 FAQ. The open group, 5 Oct 2011

    Google Scholar 

  14. http://www.csm.ornl.gov/pvm/

  15. Quinn M (2003) Parallel programming in C with MPI and OpenMP, 1st edn. McGraw-Hill Science/Engineering/Math, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Computer Institute, Ege University, Izmir, Turkey

    K. Erciyes

Authors
  1. K. Erciyes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Erciyes .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Erciyes, K. (2018). Parallel Graph Algorithms. In: Guide to Graph Algorithms. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-73235-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73235-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73234-3

  • Online ISBN: 978-3-319-73235-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation