Scheduling computations with provably low synchronization overheads
Open Access
- 21 October 2021
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 25 (1) , 107-124
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Fundação para a Ciência e a Tecnologia (UID/CEC/04516/2019)
This publication has 24 references indexed in Scilit:
- Lace: Non-blocking Split Deque for Work-Stealing2014
- x86-TSOCommunications of the ACM, 2010
- A Tighter Analysis of Work StealingLecture Notes in Computer Science, 2010
- Adaptive work-stealing with parallelism feedbackACM Transactions on Computer Systems, 2008
- The Data Locality of Work StealingTheory of Computing Systems, 2002
- Thread Scheduling for Multiprogrammed MultiprocessorsTheory of Computing Systems, 2001
- Scheduling multithreaded computations by work stealingJournal of the ACM, 1999
- The performance of work stealing in multiprogrammed environments (extended abstract)ACM SIGMETRICS Performance Evaluation Review, 1998
- A scalable mark-sweep garbage collector on large-scale shared-memory machines1997
- Cilk: An Efficient Multithreaded Runtime SystemJournal of Parallel and Distributed Computing, 1996