The Basics of Single Node Parallel Computing

In Fall 2020 and Spring 2021, this was MIT's 18.337J/6.338J: Parallel Computing and Scientific Machine Learning course. Now these lectures and notes serve as a standalone book resource.

Chris Rackauckas, Massachusetts Institute of Technology

Additional information on these topics can be found at:

[TarunKumar-ensi]

Great explanation on dynamic vs static scheduling! I think that is something that should be part of the manual but it is unfortunately not emphasized enough.

[srinivasgorur-shandilya]

@31:54 if there are no yeild points in loops, then how come

for i in 1:1e9
a += 1
end

can be interrupted with Ctrl+C?
this works in the julia REPL (not Juno...)

I get the interrupt:

^CERROR: InterruptException:
Stacktrace:
[1] top-level scope
@ ./REPL[6]:2

[Kruglord]

That was a rather abrupt end to the lecture, but I think the material was covered well enough.

[srinivasgorur-shandilya]

I don't see the optimizations you see -- the for loop takes forever to run, and doesn't instantly return as yours does.

[nickfleming]

I watched a video back in 2015 by this professor I'm trying to remember. He was probably in his 60's, fat with a beard and long hair and an incredible teacher. He did a demonstration of connecting dozens of CPUs together to run simulations of evolution of life forms, urban traffic, entire worlds. It was mindblowing. Would you happen to know who that professor is?

[RammsteinTuskNilon]

Are you the voice of "salad fingers" ? :D