Theory of Parallel Hardware (SMA 5511)

An H shaped diagram of light blue circles connected by black lines.

Course logo. (Image courtesy of Charles Leiserson.)


MIT Course Number


As Taught In

Spring 2004



Cite This Course

Course Features

Course Description

6.896 covers mathematical foundations of parallel hardware, from computer arithmetic to physical design, focusing on algorithmic underpinnings. Topics covered include: arithmetic circuits, parallel prefix, systolic arrays, retiming, clocking methodologies, boolean logic, sorting networks, interconnection networks, hypercubic networks, P-completeness, VLSI layout theory, reconfigurable wiring, fat-trees, and area-time complexity.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5511 (Theory of Parallel Hardware).

Bradley Kuszmaul, Charles Leiserson, and Michael Bender. 6.896 Theory of Parallel Hardware (SMA 5511), Spring 2004. (Massachusetts Institute of Technology: MIT OpenCourseWare), (Accessed). License: Creative Commons BY-NC-SA

For more information about using these materials and the Creative Commons license, see our Terms of Use.