Efficient algorithms for periodic scheduling

DOI10.1016/j.comnet.2003.12.017zbMath1072.68013OpenAlexW2151576803MaRDI QIDQ1886514

Amotz Bar-Noy, Boaz Patt-Shamir, Vladimir Dreizin

Publication date: 18 November 2004

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2003.12.017

zbMATH Keywords

Fair schedulingBroadcast disksHierarchical round robinPeriodic scheduling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Perfect periodic scheduling for binary tree routing in wireless networks ⋮ Perfect periodic scheduling for three basic cycles ⋮ Minimizing the number of workers in a paced mixed-model assembly line

This page was built for publication: Efficient algorithms for periodic scheduling