Computer Science 273

[Email HKN about this data] [Info about this page]

Title	Foundations of Parallel Computation
Units	3
Prerequisites	170, or consent of instructor.
Description	Fundamental theoretical issues in designing parallel algorithms and architectures. Shared memory models of parallel computation. Parallel algorithms for linear algebra, sorting, Fourier Transform, recurrence evaluation, and graph problems. Interconnection network based models. Algorithm design techniques for networks like hypercubes, shuffle-exchanges, trees, meshes and butterfly networks. Systolic arrays and techniques for generating them. Relationships among networks and with shared memory models. Message routing. Cost of implementing shared memory and network based models in VLSI technology. Scalability issues.

Sections Instructor Teaching Effectiveness How worthwhile was this course?

Fall 2006 Rao 5.9 / 7 ± 0.8
5.9 / 7 ± 1.1

Spring 2005 Rao 5.1 / 7 ± 0.6
4.8 / 7 ± 0.7

Spring 2003 Rao 4.6 / 7 ± 0.8
4.8 / 7 ± 0.6

Spring 2001 Rao 4.8 / 7 ± 0.7
4.9 / 7 ± 0.7

Spring 1995 Ranade 4.8 / 7 ± 0.9
4.2 / 7 ± 0.8

Spring 1994 Ranade 4.9 / 7 ± 0.9
4.8 / 7 ± 1.3

Spring 1993 Ranade 4.4 / 7 ± 0.8
4.8 / 7 ± 0.8

Fall 1991 Ranade 4.9 / 7 ± 1.0
4.3 / 7 ± 1.3

Fall 1990 Ranade 5.1 / 7 ± 1.0
5.6 / 7 ± 0.5

Overall Rating Teaching Effectiveness How worthwhile was this course?

Computer Science 273 5.1 / 7 ± 0.1
5.0 / 7 ± 0.1

Hint: You can click on the colored rating bars to see detailed statistics on a particular rating.