Name
Abstract | ||
|---|---|---|
Real time scheduling algorithms like RM and EDF have been analyzed extensively in the literature. Many recent works on scheduling address energy consumption as a performance metric. In this work we analyze priority scheduling algorithms RM, EDF, and LLF along with a few power-aware scheduling algorithms: MLLF, RM_RCS and EDF_RCS. Our analysis addresses the following metrics: response time, response time jitter, latency, time complexity, preemptions, and energy consumption. We extend past work in this direction by characterizing the performance of the scheduling algorithms -- theoretically as well as experimentally. Results of our analysis can be used to control design choices for real time systems. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1363686.1363764 | SAC |
Keywords | Field | DocType |
response time,energy consumption,scheduling algorithm,response time jitter,priority scheduling,real time scheduling algorithm,power-aware scheduling algorithm,real time system,time complexity,address energy consumption,real time systems | Fixed-priority pre-emptive scheduling,Mathematical optimization,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Biju K Raveendran | 1 | 2 | 5.10 |
| Sundar Balasubramaniam | 2 | 24 | 4.09 |
| S Gurunarayanan | 3 | 4 | 3.81 |