P. Berenbrink
The natural work-stealing algorithm is stable
Berenbrink, P.; Friedetzky, T.; Goldberg, L.A.
Citation
Berenbrink, P., Friedetzky, T., & Goldberg, L. (2001, December). The natural work-stealing algorithm is stable. Presented at Proceedings 2001 IEEE International Conference on Foundations of Computer Science
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | Proceedings 2001 IEEE International Conference on Foundations of Computer Science |
| Publication Date | 2001 |
| Deposit Date | Apr 24, 2017 |
| DOI | https://doi.org/10.1109/sfcs.2001.959892 |
| Public URL | https://durham-repository.worktribe.com/output/1147167 |
You might also like
Randomized renaming in shared memory systems
(2021)
Journal Article
Time-space trade-offs in population protocols for the majority problem
(2020)
Journal Article
Self-Stabilizing Balls and Bins in Batches
(2018)
Journal Article
Threshold Load Balancing With Weighted Tasks
(2017)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search