1
6.895 covers theoretical foundations of general-purpose parallel computing systems, from languages to architecture.
FREE
This course includes
Units & Quizzes
18
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
The focus is on the algorithmic underpinnings of parallel systems. The topics for the class will vary depending on student interest, but will likely include multithreading, synchronization, race detection, load balancing, memory consistency, routing networks, message-routing algorithms, and VLSI layout theory. The class will emphasize randomized algorithms and probabilistic analysis, including high-probability arguments.
This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5509 (Theory of Parallel Systems).
Course Currilcum
-
- Dynamic Multithreading Unlimited
-
- Cilk, Matrix Multiplication, and Sorting Unlimited
- Serial Performance and Caching Unlimited
- Determinacy Detection and Race Detection Unlimited
- Memory Contention Unlimited
- Cilk Scheduler Unlimited
- Implementation of Memory Consistency Unlimited
- Lecture Slides Unlimited
- Handwritten Notes Unlimited
- Hypercubic Networks 2 Unlimited
- Permuting Data on Parallel Disks Handwritten Notes Unlimited
Massachusetts Institute of Technology
5
⭐ Instructor rating
Followers
0
Following
0
Groups
0
Friends
0
