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

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 online and adaptive scheduling strategies. The authors survey and extend results on scheduling hard deadline...

Celý popis

Podrobná bibliografia

Vydané v:	Parallel and Distributed Processing, 2nd IEEE Symposium On s. 578 - 585
Hlavní autori:	Silly, M., Chetto, H., Elyounsi, N.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE Comput. Soc. Press 1990
Predmet:	Adaptive scheduling Application software Communication system control Dynamic scheduling Process control Processor scheduling Real time systems Scheduling algorithm Testing Timing
ISBN:	0818620870, 9780818620874
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!