Reading list for Lecture 2

The paper on data parallel algorithms is moved from optional reading list of Lecture 1 to required reading list of Lecture 2.

Required Reading

1. Hillis, W. D. and Steele, G. L. 1986. Data parallel algorithms. Commun. ACM 29, 12 (Dec. 1986), 1170-1183.
2. Blelloch, G. E. 1996. Programming parallel algorithms. Commun. ACM 39, 3 (Mar. 1996), 85-97.
3. Quammen, C. 2005. Introduction to programming shared-memory and distributed-memory parallel computers. Crossroads 12, 1 (Oct. 2005), 2-2.
4. What the $#@! is Parallelism, Anyhow?

Optional Reading

• None

Reading list for Lecture 1

I shall post the Reading List for every Lecture both on the Course Website which is not yet up and also on the blog.

Required Reading

1. Larus, J. 2009. Spending Moore's dividend. Commun. ACM 52, 5 (May. 2009), 62-69.
2. Agarwal, A. and Levy, M. 2007. The kill rule for multicore. In Proceedings of the 44th Annual Design Automation Conference (San Diego, California, June 04 - 08, 2007). DAC '07. ACM, New York, NY, 750-753.

Optional Reading

1. Smith, J. E., & Sohi, G. S. (1995). Microarchitecture Of Superscalar Processors. Proceedings Of The Ieee, 83(12), 1609-1624.
2. Chapter 7 on Multicores, Multiprocessors and Clusters from Patterson, D. A., & Hennessy, J. L. (2009). Computer organization and design: The hardware/software interface. Burlington, MA: Morgan Kaufmann.