Benutzer: Gast  Login
Titel:

Schedulability analysis of non-preemptive recurring real-time tasks

Autor(en):
Baruah, S.K.; Chakraborty, S.
Stichworte:
polynomial-time approximation; recurring real-time task model; runtime overhead; uniprocessor nonpreemptive schedulability analysis; computational complexity; polynomial approximation; real-time systems; scheduling
Kongress- / Buchtitel:
Parallel and Distributed Processing Symposium. (IPDPS). 20th International
Jahr:
2006
Monat:
april
Seiten:
8 pp.
Volltext / DOI:
doi:10.1109/IPDPS.2006.1639406
 BibTeX