Conditional Remix & Share Permitted
CC BY-NC-SA
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).
- Subject:
- Applied Science
- Computer Science
- Engineering
- Material Type:
- Full Course
- Provider:
- MIT
- Provider Set:
- MIT OpenCourseWare
- Author:
- Bender, Michael
- Kuszmaul, Bradley
- Leiserson, Charles
- Date Added:
- 02/01/2004