Theory of Parallel Hardware (SMA 5511)
9 votes
Free
|
||
![]() |
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). Categories:
Computer Sciences
Starts :
2004-02-01 |
|
AlternativesIf you know any alternatives, please let us know. PrerequisitesIf you can suggest any prerequisite, please let us know. Certification Exams-- there are no exams to get certification after this course --If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory. |
Let us know when you did the course Theory of Parallel Hardware (SMA 5511).

Add the course Theory of Parallel Hardware (SMA 5511) to My Personal Education Path.

Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.
