Real-time scheduling with quality of security constraints
by Tao Xie, Xiao Qin, Andrew Sung, Man Lin, Laurence T. Yang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 3/4, 2006

Abstract: An increasing number of real-time applications such as aircraft control and medical electronics systems require high quality of security to assure confidentiality, authenticity and integrity of information. However, security requirements of real-time tasks were not adequately considered in most existing scheduling algorithms. This paper proposes a novel dynamic scheduling algorithm with security awareness for scheduling independent tasks in real-time systems. Extensive simulation experiments have been conducted to quantitatively evaluate the performance of our approach. Experimental results based on synthetic and real world traces show that compared with three baseline algorithms, the proposed algorithm can consistently improve overall system performance in terms of quality of security and guarantee ratio under a wide range of workload characteristics.

Online publication date: Thu, 10-Aug-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com