0

(

ratings

)

1

students

Created by:

Profile Photo

Last updated:

September 9, 2022

Duration:

Unlimited Duration

FREE

This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration

Description

6.895 covers theoretical foundations of general-purpose parallel computing systems, from languages to architecture.

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 Curriculum

    • Dynamic Multithreading Unlimited
    • Cilk, Matrix Multiplication, and Sorting Unlimited
    • Serial Performance and Caching Unlimited
    • Determinacy Detection and Race Detection Unlimited
    • Analyzing Space Bounds Unlimited
    • Memory Contention Unlimited
    • Cilk Scheduler Unlimited
    • Analysis of Cilk Scheduler Unlimited
    • Cilk Implementation Unlimited
    • Implementation of Memory Consistency Unlimited
    • Snoopy Caching and Spin-Block Problem Handwritten Notes Unlimited
    • Lecture Slides Unlimited
    • Handwritten Notes Unlimited
    • Hypercubic Networks 2 Unlimited
    • Hypercubic Networks 3 Unlimited
    • Lecture Slides Unlimited
    • Permuting Data on Parallel Disks Handwritten Notes Unlimited
    • Sorting and Permuting Handwritten Notes Unlimited

About the instructor

5 5

Instructor Rating

1

Reviews

1520

Courses

1915

Students

Profile Photo
Massachusetts Institute of Technology