General perfectly periodic scheduling
From MaRDI portal
Publication:5170877
DOI10.1145/571825.571854zbMath1292.68031OpenAlexW2072661408MaRDI QIDQ5170877
Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir
Publication date: 25 July 2014
Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/571825.571854
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: General perfectly periodic scheduling
