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...

Full description

Saved in:
Bibliographic Details
Published in:Parallel and Distributed Processing, 2nd IEEE Symposium On pp. 578 - 585
Main Authors: Silly, M., Chetto, H., Elyounsi, N.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1990
Subjects:
ISBN:0818620870, 9780818620874
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first