Path-Constrained Relaxed Schedulability Analysis

The schedulability analysis problem for many realistic task models is known to be hard (NP or coNP). As this severely restricts the application of these task models, recently there has been a considerable amount of interest in relaxed or approximate notions of schedulability, with the hope that they...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007) S. 474 - 482
Hauptverfasser:	Andrei, S., Chakraborty, S.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.09.2007
Schlagworte:	Algorithm design and analysis Approximation algorithms Computer science Context modeling Polynomials Processor scheduling Real time systems Scheduling algorithm Scientific computing System testing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!