User: Guest  Login
Title:

Schedulability analysis of non-preemptive recurring real-time tasks

Author(s):
Baruah, S.K.; Chakraborty, S.
Keywords:
polynomial-time approximation; recurring real-time task model; runtime overhead; uniprocessor nonpreemptive schedulability analysis; computational complexity; polynomial approximation; real-time systems; scheduling
Book / Congress title:
Parallel and Distributed Processing Symposium. (IPDPS). 20th International
Year:
2006
Month:
april
Pages:
8 pp.
Fulltext / DOI:
doi:10.1109/IPDPS.2006.1639406
 BibTeX