An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems

Abstract

Guaranteeing that time critical tasks will meet their timing constraints is an important aspect of real-time systems research. Indeed, a real time system is dynamic and consequently requires on -line and adaptive scheduling strategies. In this paper, we survey and extend results on scheduling hard deadline periodic and sporadic tasks on the monoprocessor… (More)
DOI: 10.1109/SPDP.1990.143607

Topics

  • Presentations referencing similar topics