An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling

DOI10.1007/BF02523234zbMath0864.68006OpenAlexW2039238595MaRDI QIDQ2365172

T. H. Romer, Louis E. Rosier

Publication date: 9 June 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02523234

zbMATH Keywords

Euclid's gcd algorithmpinwheel scheduling problem

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Pinwheel scheduling with two distinct numbers
• Schedulers for larger classes of pinwheel instances
• Integer Programming with a Fixed Number of Variables
• A Polynomial Algorithm for the Two-Variable Integer Programming Problem
• Unnamed Item

This page was built for publication: An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling