Nearly optimal perfectly periodic schedules

DOI10.1007/s00446-002-0085-1zbMath1448.68179OpenAlexW2721925531MaRDI QIDQ5138381

Aviv Nisgav, Boaz Patt-Shamir, Amotz Bar-Noy

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-002-0085-1

zbMATH Keywords

maintenance schedulingasymmetric communicationbroadcast diskperfectly periodic scheduling

Mathematics Subject Classification ID

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

Related Items (2)

Perfect periodic scheduling for binary tree routing in wireless networks ⋮ Perfect periodic scheduling for three basic cycles

Cites Work

• The Chairman assignment problem
• Pinwheel scheduling with two distinct numbers
• Scheduling maintenance services to three machines
• The scheduling of maintenance service
• Proportionate progress: A notion of fairness in resource allocation
• Schedulers for larger classes of pinwheel instances
• Nearly optimal perfectly-periodic schedules
• Polynomial-time approximation scheme for data broadcast
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• Packet delay under the golden ratio weighted TDM policy in a multiple-access channel
• Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nearly optimal perfectly periodic schedules