Theory of Parallel Hardware (SMA 5511)
6.896 · Electrical Engineering and Computer Science · Graduate · Spring 2004
Dr. Bradley Kuszmaul, Prof. Charles Leiserson, Prof. Michael Bender
<p>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.</p> <p>This course was also taught as part of the Singapor…
The syllabus, on MIT OpenCourseWare
The full course — syllabus, assigned readings, problem sets, exams, and lecture notes — lives on OCW. These open the real thing:
Syllabus ↗
Course overview, grading, schedule
Readings ↗
The assigned reading list, session by session
Assignments ↗
Problem sets and projects
Full course on OCW ↗
Everything, including lecture materials
Attribution
Dr. Bradley Kuszmaul, Prof. Charles Leiserson, Prof. Michael Bender. 6.896 Theory of Parallel Hardware (SMA 5511). Spring 2004. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu. License: CC BY-NC-SA 4.0.
Course materials are © their authors and licensed CC BY-NC-SA 4.0. CurrMana links to the source and does not re-host them.