Course FormatCourse Goals
Textbooks and References
Prerequisites by Topic
Major Topics Covered in Course
Introduces the basic concepts of parallel computer architectures, network topologies, and data parallel programming. Emphasizes SIMD machines (with mesh or hypercube interconnections) and networks of workstations. Studies fundamental data structures and data parallel algorithms for matrix operations and fast fourier transforms. Examines graph and geometric computations for complexity and performance characteristics. Requires a significant amount of programming to complete course assignments.
4 QH credit
Prerequisite: COM 1390, MTH 1125, MTH 1301.
Course is offered only during the Spring quarter. CS majors are guaranteed a place in class.
Spring 2xxx (This course will not be offered in the academic year 2000-2001)
This is an elective course for BS CS major and a 'focused elective' course for BA CS majors.
Professor Gene Cooperman
COM1390, MTH1125, and MTH1301 (algorithms, calculus 3, and linear algebra 1); Beyond that I required computer science maturity with a good command of C.
Software topics included: POSIX threads, sockets, MPI, CILK (for SMP), QUARK (for DSM), TOP-C (for NoW). and Legion (for wide area distributed computing).
Theoretical topics included: parallel prefix, pointer jumping, parallel sorting and parallel merging, Brent's Theorem, PRAM and circuit models and bridging models (QSM, BSP, logP).
Course project of student's choosing.