Abstract
In this chapter we discuss the analysis of parallel algorithms, especially their complexity. The complexity of serial algorithms is usually measured by the number of arithmetic operations. But the complexity of parallel algorithms is measured by the time, in which they can be implemented on a k-processor computer.
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
Preview
Unable to display preview. Download preview PDF.
References
Borodin, A. and Munro, I.: The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, New York, 1975.
Brent, R. P.: The parallel evaluation of arithmetic expressions in logarithmic time. Proc. Complexity of Sequential and Parallel Numerical Algorithms. J. F. Traub (Editor). Academic Press, New York, 1973, pp. 83–102.
Brent, R. P.: The parallel evaluation of general arithmetic expression. J. ACM, 21, 1974, 201–206.
Csanky, L.: Fast parallel matrix inversion algorithms. Tech. Report, Univ. of California, Berkeley, 1974.
Csanky, L.: On the parallel complexity of some computational problems. Dissertation. Univ. of California, Berkeley, 1974.
Gentleman, W. M.: Some complexity results for matrix computations on parallel processors. J. ACM, 25, 1978, 112–115.
Heller, D.: A survey of parallel algorithms in numerical linear algebra. Tech. Report, Comp. Sci. Dep., Carnegie-Mellon Univ., Pittsburg, Penn., 1976.
Hyafil, L. and Kung, H. T.: Bounds on the speedup of parallel evaluation of recurrences. Tech. Report, Comp. Sci. Dep., Carnegie-Mellon Univ., Pittsburgh, Penn., 1975.
Hyafil, L. and Kung, H. T.: Parallel evaluation of recurrences and parallel algorithms for solving band linear systems. Tech. Report, Comp. Sci. Dep., Carnegie-Mellon Univ., Pittsburgh, Penn., 1975.
Hyafil, L. and Kung, H. T.: The complexity of parallel evaluation of linear recurrences. Tech. Report, IRIA 1975, Rocquencourt, 96.
Kogge, P. M.: Parallel solution of recurrence problems. IBM J. Res. Develop., 18, 1974, 138–148.
Kuck, D. J.: Multioperation machine computational complexity. Proc. Complexity of Sequential and Parallel Numerical Algorithms. J. E. Traub (Editor). Academic Press, New York, 1973, pp. 17–47.
Kuck, D. J.: Parallel processing or ordinary programs. Advances in Computers, Vol. 15. Academic Press, New York, 1977, pp. 119–179.
Kung, H. T.: New algorithms and lower bounds for the parallel evaluation of certain rational expressions. Tech. Report, Comp. Sci. Dep., Carnegie-Mellon Univ., Pittsburgh, Penn., 1974.
Munro, I. and Paterson, M.: Optimal algorithms for parallel polynomial evaluation. J. Comp. Syst. Sci., 7, 1973, 189–198.
Muraoka, Y.: Parallelism exposure and exploitation. Dissertation. Dep. Comp. Sci., University of Illinois, Urbana, 1971.
Traub, J. F.: An introduction to some current research in numerical computational complexity. Tech. Report. Comp. Sci. Dep., Carnegie-Mellon Univ., Pittsburgh, Penn., 1973.
Traub, J. F.: Parallel algorithms and parallel computational complexity. Proc. IFIP Congress. North-Holland Publ. Co., Amsterdam, 1974, pp. 685–687.
Sameh, A. H. and Kuck, D. J.: On stable parallel linear system solvers. J. ACM, 25, 1978, 1, 81–91.
Sameh, A. H. and Brent, R. P.: Solving triangular system on a parallel computer. SIAM J. Numer. Anal., 6, 1977, 1101–1113.
Chen, S. C., Kuck, D. J. and Sameh, A. H.: Practical parallel band triangular system solvers. ACM Trans. on Math. Software, 3, 1978, 270–277.
Chen, S. CH. and Kuck, D. J.: Time and parallel processors bounds for linear recurrence systems. IEEE Trans. on Computers, 24, 1975, 7, 701–717.
Stone, H. S.: An efficient parallel algorithm for the solution of a tridiagonal linear system of equations. J. ACM, 20, 1973, 1, 27–38.
Evans, D. J. and Hatzopoulos, M. A.: A parallel linear system solver. Int. J. Comp. Math., 7, 1979, 227–238.
Bank, R. E. and Rose, D. J.: An 0(n2) method for solving constant coefficient boundary value problems in two dimensions. SIAM J. Numer. Anal., 12, 1975, 4, 529–540.
Buzbee, B. L.: A capacitance matrix technique. In: Sparse Matrix Computations. J. R. Bunch and D. J. Rose (Editors). Academic Press, New York, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mikloško, J., Kotov, V.E. (1984). Complexity of Parallel Algorithms. In: Mikloško, J., Kotov, V.E. (eds) Algorithms, Software and Hardware of Parallel Computers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-11106-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-11106-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-11108-6
Online ISBN: 978-3-662-11106-2
eBook Packages: Springer Book Archive