摘要
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.
原文 | 英語 |
---|---|
頁(從 - 到) | 812-816 |
頁數 | 5 |
期刊 | IEEE Transactions on Computers |
卷 | 47 |
發行號 | 7 |
DOIs | |
出版狀態 | 已發佈 - 1998 |
ASJC Scopus subject areas
- 軟體
- 理論電腦科學
- 硬體和架構
- 計算機理論與數學