Name
Abstract | ||
|---|---|---|
This paper proposes a hybrid scheduling scheme for hard, soft and non-real-time tasks. The scheme creates a constant utilization server for each real-time scheduling policy and a total bandwidth server for all the non-real-time tasks with time sharing scheduling policy. Each server has a scheduler, called server scheduler, which is responsible for executing the ready-to-run tasks with the same scheduling policy as the server. All the servers are scheduled by the bottom operating system scheduler according to EDF algorithm. The schedulability test is also presented in this paper. The hybrid scheme can be used to implement different real time systems with different goals (such as hard, soft or hybrid real-time systems) and can provide the real-time services with different QoS to the different task modes by adjusting every constant utilization server's size. This scheme also simplifies the schedulability analysis and validates the schedulability of the tasks with one scheduling policy independently of the tasks with other scheduling policies. The experimental results show that the hybrid scheme is an efficient scheduling scheme. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISORC.2006.6 | ISORC |
Keywords | Field | DocType |
real time,bandwidth,scheduling algorithm,time sharing,embedded computing,quality of service,operating systems,embedded system,operating system,scheduling,testing,qos,real time systems,grid computing | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Hybrid Scheduling,Distributed computing | Conference |
Volume | Issue | ISBN |
null | null | 0-7695-2561-X |
Citations | PageRank | References |
2 | 0.41 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pengliu Tan | 1 | 18 | 4.28 |
| Hai Jin | 2 | 6544 | 644.63 |
| Minghu Zhang | 3 | 28 | 5.50 |