Abstract
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={a1,..., an}, the problem is to find an infinite sequence (schedule) of symbols from {1,2,...,n} such that there is at least one symboli within any interval of ai symbols (slots). Not all instancesA can be scheduled; for example, no “successful” schedule exists for instances whose density,ρ(A)=∑ i i (l/ai), is larger than 1. It has been shown that all instances whose densities are less than a 0.5 density threshold can always be scheduled. If a schedule exists, another concern is the design of a fast on-line scheduler (FOLS) which can generate each symbol of the schedule in constant time. Based on the idea of “integer reduction,” two new FOLSs which can schedule different classes of pinwheel instances, are proposed in this paper. One uses “single-integer reduction” and the other uses “double-integer” reduction. They both improve the previous 0.5 result and have density thresholds of 13/20 and2/3, respectively. In particular, if the elements inA are large, the density thresholds will asymptotically approach In 2 and 1/R2, respectively.
Similar content being viewed by others
References
M. Y. Chan and F. Chin, General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction,IEEE Transactions on Computers,41 (6) (1992), 755–768.
S. K. Dhall and C. L. Liu, On a Real-Time Scheduling Problem,Operations Research,26 (1) (1978), 127–140.
J. Du, On a Graph Representation of Cyclic Schedules in Pinwheel Scheduling, Manuscript, Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong, 1991.
R. Holte, A. Mok, L. Rosier, I. Tulchinsky, and D. Varvel, The Pinwheel: A Real-Time Scheduling Problem,Proceedings of the 22nd Hawaii International Conference on System Science, January 1989, pp. 693–702.
R. Holte, L. Rosier, I. Tulchinsky, and D. Varvel, Pinwheel Scheduling with Two Distinct Numbers,Theoretical Computer Science (to appear).
D. Knuth,The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1975.
E. L. Lawler and C. U. Martel, Scheduling Periodically Occurring Tasks on Multiple Processors,Information Processing Letters,12 (1) (1981), 9–12.
J. Y.-T. Leung, A New Algorithm for Scheduling Periodic, Real-Time Tasks,Algorithmica,4 (1989), 209–219.
J. Y.-T. Leung and M. L. Merrill, A Note on Preemptive Scheduling of Periodic, Real-Time Tasks,Information Processing Letters,11 (1980), 115–118.
J. Y.-T. Leung and J. Whitehead, On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks,Performance Evaluation,2 (1982), 237–250.
C. L. Liu and J. W. Layland, Scheduling Algorithms for Multiprogramming Systems in a Hard-Real-Time Environment,Journal of the Association for Computing Machinery,20 (1973), 46–61.
B. Stewart,Theory of Numbers, Macmillan, New York, 1960.
W. D. Wei and C. L. Liu, On a Periodic Maintenance Problem,Operations Research Letters,2(2) (1983), 90–93.
Author information
Authors and Affiliations
Additional information
Communicated by C. L. Liu.
This research was supported in part by ONR Grant N00014-87-K-0833, and was done while Francis Chin was visiting the Computer Science Program, The University of Texas at Dallas, Richardson, TX 75083, USA.
Rights and permissions
About this article
Cite this article
Chan, M.Y., Chin, F. Schedulers for larger classes of pinwheel instances. Algorithmica 9, 425–462 (1993). https://doi.org/10.1007/BF01187034
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01187034