National Chengchi University
Uedu Main Site
Explore Uedu
Student Console
Register as Member/Login
Research Informed Consent Center
Survey Center
Teacher Console
Course Setup
Support & Messages
Uptime Data

UeduGPTs

--

Jupyters

7

Local AI

--

Uedu Code

--

CISOSE26 Local AI Uedu Code UG26
政治大學 AQI 42 26°C PM2.5 6
AI Reply Desktop Notifications

Show a desktop notification when the AI TA finishes replying

Chat Message Notifications

Notify me when classmates post messages in the forum

Sound notification

Play an alert sound whenever there is a new notification

Uedu Open / Theory of Parallel Hardware (SMA 5511)
6.896

Theory of Parallel Hardware (SMA 5511)

Dr. Bradley Kuszmaul, Prof. Charles Leiserson, Prof. Michael Bender | Spring 2004
Data Science, Analytics & Computer Technology Software Design and Engineering Algorithms and Data Structures Computer Science Engineering Computer Design and Engineering Theory of Computation
Go to original course
CC BY-NC-SA 4.0
Course introduction

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).

Course Information
SourceMIT 開放式課程
DepartmentElectrical Engineering and Computer Science
LanguageEnglish
Number of videos0
Course videos (0)
No video materials are available for this Course yet
Go to the original course page to view