PickVidsShared memory parallelism in Julia | Kiran Pamnany | Cambridge Julia Meetup (May 2018)
推荐理由
I found his talk to be an insightful overview of this work
说明
这是2018年由The Julia Programming Language发布的一部演讲，主题归在Software performance & optimization。它讲的是parallel task scheduling这一支里的具体问题，而不是把整个领域扫一遍。适合想看推导、证明或实现细节的人。内容上可以概括成：Kiran Pamnany's Cambridge Julia Meetup talk on Julia's shared memory parallelism and its new task scheduler. It argues that fork-join and work-stealing models nest poorly and presents depth-first scheduling for composable parallelism.这些读者给出的理由，核心是：Recommended in Julia threading threads as an insightful, simple explanation of the new task scheduler.它贴着当时的技术，看的时候要记得那是那个年份的判断。从2018年到2019年，有4位不同的读者在3个不同月份把它推荐出来，其中明确叫别人去看的有0次。适合一次性看完。讲者把一个判断讲透，演示是在给这个判断配例子。如果已经会了基本定义，就把注意力放在它怎么把parallel task scheduling变成能跟着复述的例子。
视频信息
- 频道
- The Julia Programming Language
- 时长
- 26 分 34 秒
- 发布年份
- 2018
同主题更多
- How Python was Shaped by leaky Internals, Armin Ronacher, Flask framework
- CppCon 2015: Andrei Alexandrescu “std::allocator...”
- Preventing the Collapse of Civilization / Jonathan Blow (Thekla, Inc)
- "Performance Matters" by Emery Berger
- The Thirty Million Line Problem
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”