Nearly optimal perfectly-periodic schedules
From MaRDI portal
Publication:2787671
DOI10.1145/383962.383998zbMath1333.90057OpenAlexW2146867335MaRDI QIDQ2787671
Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
Publication date: 4 March 2016
Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/383962.383998
Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Related Items
Adaptive general perfectly periodic scheduling ⋮ Windows scheduling of arbitrary-length jobs on multiple machines ⋮ Nearly optimal perfectly periodic schedules ⋮ Smooth scheduling under variable rates or the analog-digital confinement game ⋮ Scheduling techniques for media-on-demand ⋮ Generating asymptotically optimal broadcasting schedules to minimize average waiting time