Schedulers for larger classes of pinwheel instances

DOI10.1007/BF01187034zbMath0778.90023MaRDI QIDQ2366229

Yanyan Li

Publication date: 29 June 1993

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

pinwheelhard-real-time schedulingsatellite ground stations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items

An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling, Scheduling parallel Kalman filters with quantized deadlines, Perpetual maintenance of machines with different urgency requirements, Stochastic sensor scheduling via distributed convex optimization, An efficient implementation of a VNS heuristic for the weighted fair sequences problem, Windows scheduling of arbitrary-length jobs on multiple machines, Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors), Nearly optimal perfectly periodic schedules, Bamboo garden trimming problem: priority schedulings, Approximation algorithms for replenishment problems with fixed turnover times, New search algorithm for solving the maintenance scheduling problem for a family of machines, A 12/7-approximation algorithm for the discrete bamboo garden trimming problem, Cutting bamboo down to size, On indexed data broadcast

Cites Work

• Unnamed Item
• A new algorithm for scheduling periodic, real-time tasks
• Scheduling periodically occurring tasks on multiple processors
• A note on preemptive scheduling of periodic, real-time tasks
• Pinwheel scheduling with two distinct numbers
• A structured computer system model
• On a periodic maintenance problem
• Sums of Functions of Digits
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• On a Real-Time Scheduling Problem
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment