Pinwheel scheduling with two distinct numbers
Theoretical Computer Science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks
IEEE Transactions on Computers
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Timely and fault-tolerant data access from broadcast disks: a pinwheel-based approach
CIKM '96 Proceedings of the workshop on Databases: active and real-time
Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model
IEEE Transactions on Computers
Distance-Constrained Scheduling and Its Applications to Real-Time Systems
IEEE Transactions on Computers
Pfair Scheduling of Generalized Pinwheel Task Systems
IEEE Transactions on Computers
Software architecture supporting integrated real-time systems
Journal of Systems and Software
Scheduling Algorithms for Real-Time Agent Systems
RIDE '96 Proceedings of the 6th International Workshop on Research Issues in Data Engineering (RIDE '96) Interoperability of Nontraditional Database Systems
Broadcast disks with polynomial cost functions
Wireless Networks
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms (TALG)
Scheduling non-uniform data with expected-time constraint in wireless multi-channel environments
Journal of Parallel and Distributed Computing
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Scheduling algorithms for dynamic message streams with distance constraints in TDMA protocol
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
On-line windows scheduling of temporary items
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A general buffer scheme for the windows scheduling problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Scheduling parallel Kalman filters for multiple processes
Automatica (Journal of IFAC)
| Hi-index | 15.00 |
The pinwheel is a hard-real-time scheduling problem for scheduling satellite ground stations to service a number of satellites without data loss. Given a multiset of positive integers (instance) A=(a/sub 1/, . . . a/sub n/), the problem is to find an infinite sequence (schedule) of symbols from (1,2, . . . n) such that there is at least one symbol i within any interval of a/sub i/ symbols (slots). Not all instances A can be scheduled; for example, no 'successful' schedule exists for instances whose density is larger than 1. It has been shown that any instance whose density is less than 2/3 can always be scheduled. Two new schedulers are proposed which improve this 2/3 result to a new 0.7 density threshold. These two schedulers can be viewed as a generalization of the previously known schedulers, i.e. they can handle a larger class of pinwheel instances including all instances schedulable by the previously known techniques.