The Power of Choice in Priority Scheduling

DOI10.1145/3087801.3087810zbMath1379.68026arXiv1706.04178OpenAlexW2625050767MaRDI QIDQ5368977

Justin Kopinsky, Giorgi Nadiradze, Dan Alistarh, Jerry Li

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.04178

zbMATH Keywords

randomized algorithmsconcurrent data structuresrelaxed data structures

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Dynamic averaging load balancing on cycles

This page was built for publication: The Power of Choice in Priority Scheduling