6.896 并行硬件理论(SMA 5511)6.896 Theory of Parallel Hardware (SMA 5511) |
|
课程网址: | http://ocw.mit.edu/courses/electrical-engineering-and-computer-sc... |
主讲教师: | Dr. Bradley Kuszmaul; Prof. Charles Leiserson; Prof. Michael Bender |
开课单位: | 麻省理工学院 |
开课时间: | 2004-01-01 |
课程语种: | 英语 |
中文简介: | 6.896包括并行硬件的数学基础,从计算机算术到物理设计,重点是算法基础。主题包括:算术电路、并行前缀、收缩阵列、重定时、时钟方法、布尔逻辑、排序网络、互连网络、超立方体网络、p-完整性、VLSI布局理论、可重构布线、胖树和区域时间复杂性。本课程也作为新加坡-麻省理工联盟(SMA)项目的一部分,作为课程编号SMA5511(并行硬件理论)授课。 |
课程简介: | 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). |
关 键 词: | 并行硬件; 计算机算法; 物理设计; 运算电路; 并行前缀; 脉动阵列; 计时方法; 布尔逻辑; 排序网络; 互连网络; 超立方体网络; P-完整性 |
课程来源: | 麻省理工学院公开课 |
最后编审: | 2024-06-21:chenjy |
阅读次数: | 8 |