Dynamic circular work-stealing deque

@inproceedings{Chase2005DynamicCW,
  title={Dynamic circular work-stealing deque},
  author={David R. Chase and Yossi Lev},
  booktitle={SPAA '05},
  year={2005}
}
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of choice in both industry and academia. This highly efficient scheme is based on a collection of array-based double-ended queues (deques) with low cost synchronization among local and stealing processes. Unfortunately, the algorithm's synchronization protocol is strongly based on the use of fixed size arrays, which are… Expand
A dynamic-sized nonblocking work stealing deque
Efficient Work-Stealing with Blocking Deques
Efficient Work-Stealing with Blocking Deques
  • Chi-Lin Liu, Ping Song, Y. Liu, Qinfen Hao
  • Computer Science
  • 2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 IEEE 6th Intl Symp on Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf on Embedded Software and Syst (HPCC,CSS,ICESS)
  • 2014
Scheduling parallel programs by work stealing with private deques
A partial multi stealing scheduling model for divide and Conquer Problems
Idempotent work stealing
Fence-free work stealing on bounded TSO processors
An adaptive task creation strategy for work-stealing scheduling
Modeling of the Memory Management Process for Dynamic Work-Stealing Schedulers
...
1
2
3
4
5
...