Name
Abstract | ||
|---|---|---|
This letter analyzes quantum-based scheduling of real-time tasks when each task is allowed to have a different quantum size. It is shown that generalized quantum-based scheduling dominates preemption threshold scheduling in the sense that if tasks are schedulable by preemption threshold scheduling then the tasks must be schedulable by generalized quantum-based scheduling, but the converse does not hold. To determine the schedulability of tasks in quantum-based scheduling, a method to calculate the worst case response time is also presented. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transinf.E92.D.332 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
real-time scheduling, quantum-based scheduling, fixed priority | Computer science,Two-level scheduling,Real-time computing,Artificial intelligence,Rate-monotonic scheduling,Fixed-priority pre-emptive scheduling,Mathematical optimization,Pattern recognition,Fair-share scheduling,Deadline-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling | Journal |
Volume | Issue | ISSN |
E92D | 2 | 1745-1361 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Byung-Gook Park | 1 | 7 | 14.38 |
| Moonju Park | 2 | 34 | 10.26 |