Abstract | ||
---|---|---|
We apply automata theory to analyze the schedulability of real-time component-based applications running on uniform multi-proces-sor platforms. The resource requirements of each application or application component are specified in a service contract resulting a hierarchy of contracts. As we are interested in determining the schedulability of such applications, this hierarchy of contracts is mapped to a hierarchical scheduling strategy. We use model checking and transform the schedulability analysis problem into a reachability checking of a timed automata model of the service contracts. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1007/978-3-642-10265-3_21 | SEUS |
Keywords | Field | DocType |
reachability checking,automata model,schedulability analysis problem,contract-based real-time scheduling,resource requirement,service contract,automata theory,model checking,real-time component-based application,hierarchical scheduling strategy,model-based analysis,application component,real time | Automata theory,Model checking,Service contract,Computer science,Scheduling (computing),Automaton,Reachability,Real-time computing,Hierarchy,Distributed computing | Conference |
Volume | ISSN | Citations |
5860 | 0302-9743 | 3 |
PageRank | References | Authors |
0.44 | 11 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Georgiana Macariu | 1 | 126 | 13.12 |
Vladimir Cretu | 2 | 26 | 6.76 |