Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A hybrid scheduling scheme for hard, soft and non-real-time tasks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Pengliu Tan ; Cluster & Grid Comput. Center, Huazhong Univ. of Sci. & Technol., Wuhan ; Hai Jin ; Minghu Zhang

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

Published in:

Object and Component-Oriented Real-Time Distributed Computing, 2006. ISORC 2006. Ninth IEEE International Symposium on

Date of Conference:

24-26 April 2006