Abstract
This chapter is intended to provide an overview of the fundamental concepts and ideas shaping the field of parallel computation. If serial (or sequential) algorithms are designed for the generic uni-processor architecture of the Random Access Machine (RAM), in the case of parallel algorithms there are a variety of models and architectures supporting the parallel mode of operation: shared-memory models, interconnection networks, combinational circuits, clusters and grids.
Sometimes, the methods used in designing sequential algorithms can also lead to efficient parallel algorithms, as it is the case with divide and conquer techniques. In other cases, the particularities of a certain model or architecture impose specific tools and methods that need to be used in order to fully exploit the potential offered by that model. In all situations, however, we seek an improvement either in the running time of the parallel algorithm or in the quality of the solution produced by the parallel algorithm with respect to the best sequential algorithm dealing with the same problem.
The improvement in performance can even become superlinear with respect to the number of processors employed by the parallel model under consideration. This is the case, for example, of computations performed under real-time constraints, when the deadlines imposed on the availability of the input and/or output data leave little room for sequentially simulating the parallel approach. Furthermore, in the examples presented at the end of the chapter, the impossibility to simulate a parallel solution on a sequential machine is due to the intrinsically parallel nature of the computation, rather than being an artifact of externally imposed time constraints.
In this respect, parallelism proves to be the vehicle leading to a Non-Universality result in computing: there is no finite computational device, sequential or parallel, conventional or unconventional, that is able to simulate all others.
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
S. G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, NJ, 1997.
J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
Y. Ben-Asher, D. Peleg, R. Ramaswami, A. Schuster, The power of reconfiguration, Journal of Parallel and Distributed Computing 13 (1991) 139–153.
C. M. Krishna, K. G. Shin, Real-Time Systems, McGraw-Hill, New York, 1997.
S. D. Bruda, S. G. Akl, On limits on the computational power of data-accumulating algorithms, Information Processing Letters 86 (4) (2003) 221–227.
S. G. Akl, Superlinear performance in real-time parallel computation, The Journal of Supercomputing 29 (1) (2004) 89–111.
S. G. Akl, Parallel real-time computation: Sometimes quality means quantity, Computing and Informatics 21 (5) (2002) 455–487.
S. G. Akl, S. D. Bruda, Improving a solution’s quality through parallel processing, The Journal of Supercomputing 19 (2001) 219–231.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, MIT Press, Cambridge, MA, 2001.
S. G. Akl, Evolving computational systems, in: S. Rajasekaran, J. H. Reif (Eds.), Parallel Computing: Models, Algorithms, and Applications, CRC Press, Boca Raton, FL 2007, a modified version is available as Technical Report No. 2006-526, School of Computing, Queen’s University, Kingston, Ontario, Canada.
J. Brown, The Quest for the Quantum Computer, Touchstone Edition, Simon & Schuster, New York, 2001.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Akl, S.G., Nagy, M. (2009). Introduction to Parallel Computation. In: Trobec, R., Vajteršic, M., Zinterhof, P. (eds) Parallel Computing. Springer, London. https://doi.org/10.1007/978-1-84882-409-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-84882-409-6_2
Publisher Name: Springer, London
Print ISBN: 978-1-84882-408-9
Online ISBN: 978-1-84882-409-6
eBook Packages: Computer ScienceComputer Science (R0)