Journal
IEEE TRANSACTIONS ON COMPUTERS
Volume 62, Issue 9, Pages 1813-1822Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TC.2012.243
Keywords
Real-time; scheduling; plan generation; periodic tasks; hyperperiod
Funding
- Spanish Government Research Office [TIN2008-06766-C03-02]
Ask authors/readers for more resources
Task period selection is often used to adjust the workload to the available computational resources. In this paper, we propose a model where each selected period is not restricted to be a natural number, but can be any rational number within a range. Under this generalization, we contribute a period selection algorithm that yields a much smaller hyperperiod than that of previous works: with respect to the largest period, the hyperperiod with integer constraints is exponentially bounded; with rational periods the worst case is only quadratic. By means of an integer approximation at each task activation, we show how our rational period approach can work under system clock granularity; it is thus compatible with scheduling analysis practice and implementation. Our finding has practical applications in several fields of real-time scheduling: lowering complexity in table driven schedulers, reducing search space in model checking analysis, generating synthetic workload for statistical analysis of real-time scheduling algorithms, etc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available