Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

@article{Baruah1990AlgorithmsAC,
title={Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor},
author={Sanjoy K. Baruah and Louis E. Rosier and Rodney R. Howell},
journal={Real-Time Systems},
year={1990},
volume={2},
pages={301-324}
}

We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all parameters to the system are integers, we may assume without loss of generality that all preemptions occur at integer time values. We then assume, for the remainder of the paper, that all parameters are indeed integers. We then give, as our main lemma, both necessary and sufficient conditions for a task system to be feasible on one processor. Although these conditions… CONTINUE READING