Skip to main content
SpringerLink
Log in

Fundamentals of Parallel Computing

  • Chapter
  • First Online:
A Practical Approach to High-Performance Computing

  • 1303 Accesses

Abstract

This chapter is devoted to the basic parallel computing laws.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 79.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

Notes

  1. 1.

    Richard Peirce Brent (b. 1946), Australian mathematician and computer scientist.

  2. 2.

    Gene Myron Amdahl (1922–2015), American computer scientist and computer technology expert.

  3. 3.

    Arthur Jay Bernstein, an American researcher, is a specialist in the field of computing systems.

  4. 4.

    Alan Mathison Turing (1912–1954), English mathematician and logician.

References

  1. Anderson, J.A.: Discrete Mathematics with Combinatorics. Prentice Hall, Upper Saddle River (2003)

    Google Scholar 

  2. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer Monographs in Mathematics. Springer, London (2008)

    Google Scholar 

  3. Bernstein, A.J.: Analysis of programs for parallel processing. IEEE Trans. Electromagn. Compat. EC-15(5), 757–763 (1966)

    Article  Google Scholar 

  4. Brent, R.P.: The parallel evaluation of general arithmetic expressions. J. Assoc. Comput. Mach. 21(2), 201–206 (1974)

    Article  MathSciNet  Google Scholar 

  5. Breshears, C.: The Art of Concurrency. O’Reilly, Beijing (2009)

    Google Scholar 

  6. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  7. Feautrier, P.: Bernstein’s conditions. In: Padua, D. (ed.) Encyclopedia of Parallel Computing. Springer Reference. Springer, Boston (2011)

    Google Scholar 

  8. Feautrier, P.: Dependences. In: Padua, D. (ed.) Encyclopedia of Parallel Computing. Springer Reference. Springer, Boston (2011)

    Google Scholar 

  9. Gonnet, G.H., Baeza-Yates, R.: Handbook of Algorithms and Data Structures: In Pascal and C, 2nd edn. International Computer Science Series. Addison-Wesley, Boston (1991)

    Google Scholar 

  10. Kruskal, C.P., Rudolph, L., Snir, M.: A complexity theory of efficient parallel algorithms. Theor. Comput. Sci. 71(1), 95–132 (1990)

    Article  MathSciNet  Google Scholar 

  11. McCool, M., Robison, A.D., Reinders, J.: Structured Parallel Programming: Patterns for Efficient Computation. Elsevier, Amsterdam (2012)

    Google Scholar 

  12. Miller, R., Boxer, L.: Algorithms Sequential and Parallel: A Unified Approach, 3rd edn. Cengage Learning, Boston (2013)

    Google Scholar 

  13. Padua, D.A., Wolfe, M.J.: Advanced compiler optimizations for supercomputers. Commun. ACM 29(12), 1184–1201 (1986)

    Article  Google Scholar 

  14. Rauber, T., Rünger, G.: Parallel Programming for Multicore and Cluster Systems, 2nd edn. Springer, Berlin (2013)

    MATH  Google Scholar 

  15. Rosen, K.H., Michaels, J.G., Gross, J.L., et al. (eds.): Handbook of Discrete and Combinatorial Mathematics. Discrete Mathematics and Its Applications. CRC Press, Boca Raton (2000)

    MATH  Google Scholar 

  16. Shen, A., Vereshchagin, N.K.: Computable Functions. Student Mathematical Library, vol. 19. American Mathematical Society, Providence (2003)

    Google Scholar 

  17. Smith, J.R.: The Design and Analysis of Parallel Algorithms. Oxford University Press, New York (1993)

    MATH  Google Scholar 

  18. Wilkinson, B., Allen, M.: Parallel Programming Techniques and Applications Using Networked Workstations and Parallel Computers, 2nd edn. Pearson Prentice Hall, Upper Saddle River (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Digital Technologies, Voronezh State University, Voronezh, Russia

    Sergei Kurgalin & Sergei Borzunov

Authors
  1. Sergei Kurgalin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergei Borzunov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kurgalin, S., Borzunov, S. (2019). Fundamentals of Parallel Computing. In: A Practical Approach to High-Performance Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-27558-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27558-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27557-0

  • Online ISBN: 978-3-030-27558-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation