Abstract
In many cases, the development of an efficient parallel algorithm for the solution of some problem requires new ideas and methods in comparison with the creation of a sequential version of the algorithm. Examples are the practically important problems of searching for a target element in a data structure and of computation of the value of an algebraic expression. The present chapter discusses algorithms for array element summation and data sorting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Donald Lewis Shell (1924–2015), American researcher in the field of computer science.
- 2.
Vaughan Ronald Pratt (b. 1944), American researcher, specializing in the fields of informatics and computing.
- 3.
Thomas Nathaniel Hibbard (1929–2016), American researcher in the field of computer science.
- 4.
Johann Carl Friedrich Gauss (1777–1855), a prominent German mathematician and astronomer.
- 5.
Donald Ervin Knuth (b. 1938), an American scientist, specializing in the fields of informatics and computing.
- 6.
Robert Sedgewick (b. 1946), an American researcher, specializing in the fields of informatics and computer technology.
- 7.
Lothar Collatz (1910–1990), German mathematician.
References
Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice Hall, Upper Saddle River (1989)
Breshears, C.: The Art of Concurrency. O’Reilly, Beijing (2009)
Casanova, H., Legrand, A., Robert, Y.: Parallel Algorithms. Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series. CRC Press, Boca Raton (2008)
Dow, M.: Transposing a matrix on a vector computer. Parallel Comput. 21, 1997–2005 (1995)
Hibbard, T.N.: An empirical study of minimal storage sorting. Commun. ACM 6(5), 206–213 (1963)
Knuth, D.E.: The Art of Computer Programming, vol. 3. Seminumerical Algorithms, 2nd edn. Addison-Wesley, Boston (1998)
Kurgalin, S., Borzunov, S.: The Discrete Math Workbook: A Companion Manual for Practical Study. Texts in Computer Science. Springer, Berlin (2018)
Lagarias, J.C. (ed.): The Ultimate Challenge: The 3x+1 Problem. American Mathematical Society, Providence (2010)
Linux Man-Pages Project: Linux Programmer’s Manual, Drand48_r(3) (2018). http://man7.org/linux/man-pages/man3/drand48_r.3.html
McConnell, J.J.: Analysis of Algorithms: An Active Learning Approach, 2nd edn. Jones and Bartlett, Burlington (2008)
Miller, R., Boxer, L.: Algorithms Sequential and Parallel: A Unified Approach, 3rd edn. Cengage Learning, Boston (2013)
Ortega, J.M.: Introduction to Parallel and Vector Solution of Linear Systems. Frontiers in Computer Science. Springer, Berlin (1988)
Pacheco, P.S.: An Introduction to Parallel Programming. Elsevier, Amsterdam (2011)
Pratt, V.R.: Shellsort and Sorting Networks. Outstanding Dissertations in the Computer Sciences. Garland, New York (1979)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes: The Art of Scientific Computing, 3rd edn. Cambridge University Press, Cambridge (2007)
Quinn, M.J.: Parallel Programming in C with MPI and OpenMP. McGraw-Hill Higher Education, Boston (2004)
Sedgewick, R.: A new upper bound for shellsort. J. Algorithms 7(2), 159–173 (1986)
Sedgewick, R.: Algorithms in C, 3rd edn. Addison-Wesley, Boston (1998)
Shell, D.L.: A high-speed sorting procedure. Commun. ACM 2(7), 30–32 (1959)
Voevodin, V.V.: Mathematical Foundations of Parallel Computing. World Scientific Series in Computer Science, vol. 33. World Scientific, Singapore (1992)
Wilkinson, B., Allen, M.: Parallel Programming Techniques and Applications Using Networked Workstations and Parallel Computers, 2nd edn. Pearson Prentice Hall, Upper Saddle River (2004)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kurgalin, S., Borzunov, S. (2019). Implementation of Parallel Algorithms. In: A Practical Approach to High-Performance Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-27558-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-27558-7_6
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)