martes, 21 de febrero de 2017

Ficha del recurso:


Vínculo original en IEEE Computer Society
Ripoll, Ismael; Ballester-Ripoll, Rafael

Última actualización:

viernes, 9 de noviembre de 2012

Entrada en el observatorio:

viernes, 9 de noviembre de 2012



Archivado en:

Period Selection for Minimal Hyper-period in Periodic Task Systems

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 generalisation, we contribute a period selection algorithm that yields a much smaller hyper-period than that of previous works: with respect to the largest period, the hyper-period 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.