By Topic

General schedulers for the pinwheel problem based on double-integer reduction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mee Yee Chan ; Dept. of Comput. Sci., Hong Kong Univ., Hong Kong ; Chin, F.Y.L.

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 1, . . . an}, 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 ai 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

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 6 )