Abstract
Theory of parallel computation is still a widely unanswered field of research. The lack of truly parallel data structures (such as quantum computing may provide one day) still prevents us from obtaining a unified framework for the design of parallel algorithms, and the design of parallel algorithms remains a case-by-case challenge. As the complexity-related questions have been progressively (and regrettably) abandoned, theoretical research in parallel computing focuses today on two main areas: the classical design of parallel algorithms for specific problems; and very recently, modeling, understanding and formalizing how entities/structures/networks interact in parallel in order to design better parallel algorithms.
Chapter PDF
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shavit, N., Schabanel, N., Felber, P., Kaklamanis, C. (2007). Topic 12 Theory and Algorithms for Parallel Computation. In: Kermarrec, AM., Bougé, L., Priol, T. (eds) Euro-Par 2007 Parallel Processing. Euro-Par 2007. Lecture Notes in Computer Science, vol 4641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74466-5_84
Download citation
DOI: https://doi.org/10.1007/978-3-540-74466-5_84
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74465-8
Online ISBN: 978-3-540-74466-5
eBook Packages: Computer ScienceComputer Science (R0)