Title | ||
---|---|---|
A Novel Approach For Off-Line Multiprocessor Scheduling In Embedded Hard Real-Time Systems |
Abstract | ||
---|---|---|
There are two general approaches for scheduling tasks in real-time systems: runtime and pre-runtime scheduling. However, there are several situations where the runtime approach does not find a feasible schedule even if such a schedule exists. The proposed approach uses state space exploration for finding a pre-runtime scheduling. The main problem with such methods is the space size, which can grow exponentially. This paper shows how to minimize this problem, and presents a depth-first search method on a timed labeled transition system derived from the time Petri net model. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1007/1-4020-8149-9_16 | DESIGN METHODS AND APPLICATIONS FOR DISTRIBUTED EMBEDDED SYSTEMS |
Keywords | Field | DocType |
embedded real-time systems, scheduling, formal methods, and time Petri nets | Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling | Conference |
Volume | ISSN | Citations |
150 | 1571-5736 | 2 |
PageRank | References | Authors |
0.38 | 9 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Raimundo S. Barreto | 1 | 38 | 7.66 |
paulo maciel | 2 | 31 | 1.72 |
marilia neves | 3 | 2 | 1.06 |
Eduardo Tavares | 4 | 161 | 25.22 |
ricardo lima | 5 | 2 | 0.38 |