Introduction to parallel models of computation (Ie.g.R, PRAM's, fixed interconnection networks), relationships and simulation results between models, processor-time and area-time tradeoffs; parallel algorithm techniques and their implementation on different models for problems such as sorting, graph problems, message routing, and numerical and algebraic problems; lower bound results on communication complexity, inherently sequential problems; layout techniques and their relationships to VLSI layout systems.

Usually Offered:	Dormant
Credit:	3 hours (class)
Prerequisite:	CS 580
University Catalog:	CS 650