Work Assisting - Linking Task-Parallel Work Stealing with Data-Parallel Self Scheduling
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a novel scheduling strategy called work assisting in this 25-minute conference talk from ARRAY 2024. Discover how this approach combines data parallelism with task parallelism, allowing threads to share their current data-parallel activity in a shared array for assistance from other threads. Learn about the advantages of preserving data parallelism structure instead of implementing all parallelism as task parallelism, enabling the use of self-scheduling for data-parallel algorithms. Understand how this flexible scheduling algorithm adapts to different scenarios, potentially outperforming schedulers based purely on task parallelism. Examine benchmarks demonstrating the performance of this innovative approach in various problem domains.
Syllabus
[ARRAY24] Work Assisting: Linking Task-Parallel Work Stealing with Data-Parallel Self Scheduling
Taught by
ACM SIGPLAN
Related Courses
Distributed Programming in JavaRice University via Coursera Основы разработки на C++: красный пояс
Moscow Institute of Physics and Technology via Coursera Многопоточность
Moscow Institute of Physics and Technology via Coursera LAFF-On Programming for High Performance
The University of Texas at Austin via edX Android-разработка: основы, многопоточность, архитектура
Moscow Institute of Physics and Technology via Coursera