Shared memory parallelism in Julia | Kiran Pamnany | Cambridge Julia Meetup (May 2018)

What people said

falkaer · 2019-11 · Recommendation

By far the most interesting part of this release is the new multi-threading features, I recommend reading [LINK] for an overview, and watching [VIDEO] for a talk about some unique stuff that's being worked on with Julia's multi-threading (though the depth-first scheduling is not in 1.3 afaik).

Read the original HN comment ↗

StefanKarpinski · 2019-07 · Recommendation

Consider a machine with N cores running a program which spawns N parallel tasks, each of which in turn spawns N parallel tasks. Which subtasks do the cores work on initially? If it's the first subtask of each top-level task, that's breadth-first scheduling. If it's all N subtasks of the first top-level task, that's depth-first scheduling. The latter is better for high-performance computing because it tends to be the lower level libraries that are really carefully tuned to make optimal use of the machine (think BLAS/FTT/parallel sum/prefix sum). Previously it was unknown how to implement this kind of scheduling efficiently. See this talk by Kiran Pamnany for more details: [VIDEO]

Read the original HN comment ↗

jrevels · 2018-10 · Recommendation

This work has been a monumental collaborative effort and I think the eventual outcome will be pretty spectacular. I gave a talk at an MIT Julia meetup a few months ago that the author of this PR also spoke at; I found his talk to be an insightful overview of this work: [VIDEO]

Read the original HN comment ↗