论文信息 - Implementation of Parallel Algorithms

Implementation of Parallel Algorithms

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.

Sergei Kurgalin | Sergei Borzunov

[1] Peter S. Pacheco. An Introduction to Parallel Programming , 2011 .

[2] Thomas N. Hibbard. An empirical study of minimal storage sorting , 1963, CACM.

[3] Clay Breshears. The art of concurrency , 2009 .

[4] Jeffrey C. Lagarias,et al. The Ultimate Challenge: The 3x+1 Problem , 2011 .

[5] Valentin V. Voevodin. Mathematical Foundations of Parallel Computing , 1992, World Scientific Series in Computer Science.

[6] Michael Allen,et al. Parallel programming: techniques and applications using networked workstations and parallel computers , 1998 .

[7] Robert Sedgewick. A New Upper Bound for Shellsort , 1986, J. Algorithms.

[8] J. Ortega. Introduction to Parallel and Vector Solution of Linear Systems , 1988, Frontiers of Computer Science.

[9] Sergei Kurgalin,et al. The Discrete Math Workbook: A Companion Manual for Practical Study , 2018 .

[10] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[11] Selim G. Akl,et al. Design and analysis of parallel algorithms , 1985 .

[12] Murray Dow. Transposing a Matrix on a Vector Computer , 1995, Parallel Comput..

[13] Donald L. Shell,et al. A high-speed sorting procedure , 1959, CACM.

[14] Henri Casanova,et al. Parallel Algorithms , 2019, Design and Analysis of Algorithms.