Scheduling parallel programs by work stealing with private deques
- 23 February 2013
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 48 (8), 219-228
- https://doi.org/10.1145/2442516.2442538
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Implicitly threaded parallelism in ManticoreJournal of Functional Programming, 2010
- CarbonACM SIGARCH Computer Architecture News, 2007
- A dynamic-sized nonblocking work stealing dequeDistributed Computing, 2005
- Pursuing Laziness for Efficient Implementation of Modern Multithreaded LanguagesLecture Notes in Computer Science, 2003
- The Natural Work-Stealing Algorithm is StableSIAM Journal on Computing, 2003
- Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped ComputationsThe Computer Journal, 2002
- Scheduling multithreaded computations by work stealingJournal of the ACM, 1999
- A provable time and space efficient implementation of NESLPublished by Association for Computing Machinery (ACM) ,1996
- Analysis of the effects of delays on load sharingInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1989
- A comparison of receiver-initiated and sender-initiated adaptive load sharingPerformance Evaluation, 1986