Abstract
The scheduling of generalized pinwheel task systems is considered. It is shown that pinwheel scheduling is closely related to the fair scheduling of periodic task systems. This relationship is exploited to obtain new scheduling algorithms for generalized pinwheel task systems. When compared to traditional pinwheel scheduling algorithms, these new algorithms are both more efficient from a run-time complexity point of view, and have a higher density threshold, on a very large subclass of generalized pinwheel task systems.
Original language | English |
---|---|
Pages (from-to) | 812-816 |
Number of pages | 5 |
Journal | IEEE Transactions on Computers |
Volume | 47 |
Issue number | 7 |
DOIs | |
Publication status | Published - 1998 |
Keywords
- Density threshold
- Fairness
- Generalized pinwheels
- Real-time scheduling
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics