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 and Suggested Reading
Akl, S. G., Parallel Sorting Algorithms, Academic Press, 1985.
Akl, S. G., Parallel Computation: Models and Methods, Prentice-Hall, 1997.
Cormen, T. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.
JaJa, J. F., “Fundamentals of Parallel Algorithms,” Chapter 12 in Parallel and Distributed Computing Handbook, Edited by A. Y. Zomaya, McGraw-Hill, 1996, pp. 333–354.
Knuth, D. E., The Art of Computer Programming: Vol. 3—Sorting and Searching, Addison-Wesley, 1973.
Lakshmivarahan, S., and S. K. Dhall, Parallel Computing Using the Prefix Problem, Oxford University Press, 1994.
Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). A Taste of Parallel Algorithms. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_2
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive