Handout #4: Chapter 30 of Cormen, Leiserson, Rivest:
Introduction to Algorithms (not available online).
Handout #5: Guy E. Blelloch:
Scan Primitives and Parallel Vector Models,
Ph. D. thesis (not available online).
Handout #6: Abhiram G. Ranade:
How to emulate shared memory,
(not available online).
Handout #7: Pages 392--396 and 439--456 of Tom Leighton,
Introduction to Parallel Algorithms and Architectures,
(not available online).
Handout #8: Blelloch, Leiserson, Maggs, Plaxton, Smith,
Zagha,
A Comparison of Sorting Algorithms for the Connection
Machine CM-2,
(not available online).
Reading:
Chapter 28 of Cormen, Leiserson, Rivest:
Introduction to Algorithms (not available online,
not handed out).
Handout #21:
Robert D. Blumofe, Matteo Frigo,
Christopher F. Joerg, Charles E. Leiserson and Keith H. Randall:
An Analysis of Dag-Consistent Distributed Shared-Memory
Algorithms, appeared in the Proceedings of the Eighth Annual ACM
Symposium on Parallel Algorithms and Architectures, SPAA~'96.
Handout #25:
T. von Eicken, D. E. Culler, S. C. Goldstein, K. E. Schauser:
Active Messages: a Mechanism for Integrated Communication
and Computation (appeared in ISCA 1992). Not available online.
Handout #26:
Term Project Write-up and Presentation.
Details on how you must write your term project paper.
This page is maintained by Matteo Frigo
545 Technology Square NE 43-203, Cambridge, MA 02139, USA.
athena@theory.lcs.mit.edu
