Class Notes: Programming Parallel Algorithms CS 15-840B (Fall 1992)
暂无分享,去创建一个
These are the lecture notes for CS 15-840B, a hands-on class in programming parallel algorithms. The class was taught in the fall of 1992 by Guy Blelloch, using the programming language NESL. It stressed the clean and concise expression of a variety of parallel algorithms. About 35 graduate students attended the class, of whom 28 took it for credit. These notes were written by students in the class, and were then reviewed and organized by Guy Blelloch and Jonathan Hardwick. The sample NESL code has been converted from the older LISP-style syntax into the new ML-style syntax. These notes are not in a polished form, and probably contain several errors and omissions, particularly with respect to references in the literature. Corrections are welcome.
[1] Uzi Vishkin,et al. Deterministic Sampling - A New Technique for Fast Pattern Matching , 1991, SIAM J. Comput..
[2] L. W. Tucker,et al. Object recognition using the Connection Machine , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.
[3] Mihalis Yannakakis,et al. High-Probability Parallel Transitive-Closure Algorithms , 1991, SIAM J. Comput..