Towards Zero Spawn Overhead: Work Stealing Without Deques
Open Access
- 16 July 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 75-88
Abstract
No abstract availableFunding Information
- Universitas Brawijaya (DENA0003965)
- Universitas Brawijaya (FA87501921000)
- Universitas Brawijaya (CCF-1910568,CCF-1943456)
This publication has 21 references indexed in Scilit:
- TapirXLA: Embedding Fork-Join Parallelism into the XLA Compiler in TensorFlow Using Tapir2019
- Oracle-guided scheduling for controlling granularity in implicitly parallel languagesJournal of Functional Programming, 2016
- Scheduling parallel programs by work stealing with private deques2013
- The Cilk++ concurrency platformThe Journal of Supercomputing, 2010
- Lazy binary-splitting2010
- Backtracking-based load balancing2009
- Cilk: An Efficient Multithreaded Runtime SystemJournal of Parallel and Distributed Computing, 1996
- Using the run-time sizes of data structures to guide parallel-thread creationACM SIGPLAN Lisp Pointers, 1994
- Lazy task creation: a technique for increasing the granularity of parallel programsIEEE Transactions on Parallel and Distributed Systems, 1991
- WorkCrews: An abstraction for controlling parallelismInternational Journal of Parallel Programming, 1988