A pinwheel scheduler for three distinct numbers with a tight schedulability bound
From MaRDI portal
Publication:1386768
DOI10.1007/PL00009181zbMath0898.68005OpenAlexW1968204947MaRDI QIDQ1386768
Publication date: 26 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009181
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Two Robots Patrolling on a Line: Integer Version and Approximability ⋮ Perpetual maintenance of machines with different urgency requirements ⋮ Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) ⋮ Bamboo garden trimming problem: priority schedulings ⋮ Cutting bamboo down to size
This page was built for publication: A pinwheel scheduler for three distinct numbers with a tight schedulability bound
