Introduction to the Complexity of Parallel Algorithms
We present an introduction to the general theory of complexity of parallel algorithms. We first recall the main results of sequential complexity, then introduce models for parallel computation and compare them to sequential models. We show that some of these models are not reasonable and explain the parallel computation thesis for reasonable models. Finally we study the PRAM model and give basic complexity results for parallel algorithms.
KeywordsComplexity parallel algorithms PRAM
Unable to display preview. Download preview PDF.
- G.M. Amdahl, Validity of a single processor approach of achieving large scale computing capabilities. AFIPS Conf. Proc. 30, 483–485, 1967.Google Scholar
- S. Cook, The complexity of theorem proving procedures. 3rd. ACM Symp. on Theory of Computing, 151–158, 1971.Google Scholar
- M. Cosnard and D. Trystram, Parallel Algorithms and Architectures. Thomson Computer Press, 1995.Google Scholar
- A. Gibbons and W. Rytter, Eficient parallel algorithms. Cambridge University Press, 1988.Google Scholar
- I. Munro and M. Paterson, Optimal algorithms for parallel polynomial evaluation. Journal Comput. System Sci. 189–198, 1973.Google Scholar
- N. Pippenger, On simultaneous resource bounds. 20th. IEEE Symp. on Foundations of Computer Science, 307–311, 1979.Google Scholar
- M.J. Serna, The parallel approximability of P-complete problems. PhD Thesis, Universitat Politechnica de Catalunya, 1990.Google Scholar
- H. Vollmer, The gap-language-technique revisited. Proc. Computer Science and Logic 91, LNCS, Springer-Verlag, 1991.Google Scholar