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 and Suggested Reading
Akl, S. G., Parallel Computation: Models and Methods, Prentice-Hall, 1997.
Fortune, S., and J. Wyllie, “Parallelism in Random Access Machines,” Proc. 10th Annual ACM Symp. Theory of Computing, 1978, pp. 114–118.
JaJa, J., An Introduction to Parallel Algorithms, Addison-Wesley, 1992.
Kronsjo, L. I., “PRAM Models,” Chapter 6 in Parallel and Distributed Computing Handbook, edited by A. Y. Zomaya, McGraw-Hill, 1996, pp. 163–191.
Quinn, M. J., Parallel Computing: Theory and Practice, McGraw-Hill, 1994.
Reid-Miller, M., G. L. Miller, and F. Modugno, “List Ranking and Parallel Tree Contraction,” Chapter 3 in Synthesis of Parallel Algorithms, edited by J. H. Reif, Morgan Kaufmann, 1993, pp. 115–194.
Wang, H., A. Nicolau, and K.-Y. S. Siu, “The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints,” IEEE Trans. Computers, Vol. 45, No. 11, pp. 1257–1271, November 1996.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). PRAM and Basic Algorithms. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_5
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive