Benutzer: Gast  Login
Titel:

Approximate schedulability analysis

Autor(en):
Chakraborty, S.; Kunzli, S.; Thiele, L.
Stichworte:
algorithms; approximate schedulability analysis; complexity; input error parameter; optimization problems; polynomial time; running time; task independence assumptions; task models; computational complexity; optimisation; processor scheduling; real-time systems
Kongress- / Buchtitel:
IEEE Real-Time Systems Symposium
Jahr:
2002
Seiten:
159 - 168
Volltext / DOI:
doi:10.1109/REAL.2002.1181571
 BibTeX