article

Real-time scheduling with quality of security constraints

Authors:

Laurence T. YangAuthors Info & Claims

International Journal of High Performance Computing and Networking, Volume 4, Issue 3/4

Pages 188 - 197

https://doi.org/10.1504/IJHPCN.2006.010640

Published: 01 August 2006 Publication History

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.

References

[1]

Abdelzaher, T.F. and Shin, K.G. (1998) 'End-host architecture for QoS-adaptive communication', Proceedings of IEEE Real-Time Technology and Applications Symposium, June, p. 121.

[2]

Abdelzaher, T.F. and Shin, K.G. (1999) 'Combined task and message scheduling in distributed real-time systems', IEEE Trans. Parallel and Distributed Systems, Vol. 10, No. 11, November, pp. 1179-1191.

Digital Library

[3]

Azzedin, F. and Maheswaran, M. (2002) 'Towards trust-aware resource management in grid computing systems', Proceedings of the 2nd IEEE/ACM Int'l Symposium on Cluster Computing and the Grid, Berlin, Germany, May.

Digital Library

[4]

Donoho, G. (2004) 'Building a web service to provide real-time stock quotes', MCAD.Net, February.

[5]

Harchol-Balter, M. and Downey, A. (1997) 'Exploiting process lifetime distributions for load balancing', ACM Transaction on Computer Systems, Vol. 3, No. 31, March, pp. 253-285.

Digital Library

[6]

Kalogeraki, V., Melliar-Smith, P.M. and Moser, L.E. (2000) 'Dynamic scheduling for soft real-time distributed object systems', Proceedings of IEEE Int'l Symposium on Object-Oriented Real-Time Distributed Computing, pp. 114-121.

[7]

Kwok, Y.K., Ahmad, I. and Gu, J. (1996) 'FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel machines', Proceedings of the 25th Int'l Conference on Parallel Processing, pp. II:150-157.

[8]

Liu, C.L. and Layland, J.W. (1973) 'Scheduling algorithms for multiprogramming in a hard real-time environment', Journal of the ACM, Vol. 20, No. 1, pp. 46-61.

Digital Library

[9]

Lu, C.Y., Stankovic, J.A., Tao, G. and Son, S.H. (1999) 'Design and evaluation of a feedback control EDF scheduling algorithm', Proceedings of IEEE Real-Time Systems Symposium, Phoenix, Arizona, December.

[10]

Manimaran, G. and Murthy, C.S.R (1998) 'An efficient dynamic scheduling algorithm for multimachine real-time systems', IEEE Transaction on Parallel and Distributed Systems, Vol. 9, No. 3, pp. 312-319.

Digital Library

[11]

Marbini, A.D. and Sacks, L. (2002) 'Considering control theory in resource management scenarios', Proceedings of London Communications Symposium, London, England.

[12]

Palencia, J.C. and Gonzalez, H.M. (1998) 'Schedulability analysis for tasks with static and dynamic offsets', Proceedings of the 19th IEEE Real-Time Systems Symposium, pp. 26-37.

Digital Library

[13]

Palis, M.A. (2002) 'Online real-time job scheduling with rate of progress guarantees', Proceedings of the 6th Int'l Symposium on Parallel Architectures, Algorithms, and Networks, pp. 65-70.

[14]

Qin, X. (2005) 'Improving network performance through task duplication for parallel applications on clusters', Proc. 24th IEEE Int'l Performance, Computing, and Communications Conference, Phoenix, Arizona, April.

[15]

Qin, X. and Jiang, H. (2001) 'Dynamic, reliability-driven scheduling of parallel real-time jobs in heterogeneous systems', Proc. Int'l Conf. Parallel Processing, Valencia, Spain, pp. 113-122.

[16]

Qin, X. and Jiang, H. (2005) 'Improving effective bandwidth of networks on clusters using load balancing for communication-intensive applications', Proceedings of the 24th IEEE Int'l Performance, Computing, and Communications Conf. (IPCCC 2005), Phoenix, Arizona, April.

[17]

Qin, X., Jiang, H.D. and Swanson, R. (2002) 'An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems', Proc. Int'l Conf. Parallel Processing, British Columbia, Canada, August, pp. 360-368.

Digital Library

[18]

Ramamritham, K. and Stankovic, J.A. (1984) 'Dynamic task scheduling in distributed hard real-time system', IEEE Software, Vol. 1, No. 3, July, pp. 65-75.

Digital Library

[19]

Stankovic, J., Spuri, M., Ramamritham, K. and Buttazzo, G.C. (1998) Deadline Scheduling for Real-time systems: EDF and Related Algorithms, Kluwer Academic Publishers, Boston, Massachusetts, USA.

[20]

Stankovic, J.A., He, T., Abdelzaher, T., Marley, M., Tao G., Son, S. and Lu C. (2001) 'Feedback control scheduling in distributed real-time system', Proc. 22nd IEEE Real-Time Systems Symposium, London, England, December.

Digital Library

[21]

Thomadakis, M.E. and Liu, J.C. (1999) 'On the efficient scheduling of non-periodic tasks in hard real-time systems', Proc. IEEE Real-Time Systems Symposium, pp. 148-151.

[22]

VeriSign Corp. (2003) Simplifying Application and Web Services Security - VeriSign Trust Gateway.

[23]

Xie, T., Qin, X. and Sung, A. (2005) 'SAREC: a security-aware scheduling strategy for real-time applications on clusters', Proc. 34th Int'l Conf. Parallel Processing, Norway, pp. 5-12.

[24]

Zhang, X., Qu Y. and Xiao, L. (2000) 'Improving distributed workload performance by sharing both CPU and memory resources', Proc. 20th Int'l Conf. Distributed Computing Systems (ICDCS), April.

[25]

Zhao, W., Ramamritham, K. and Stankovic, J.A. (1987) 'Preemptive scheduling under time and resource constraints', IEEE Transactions on Computers, pp. 36-38.

Cited By

Senapati DBhagat PKarfa CSarkar A(2025)SHIELD: Security-Aware Scheduling for Real-Time DAGs on Heterogeneous SystemsACM Transactions on Cyber-Physical Systems10.1145/37022369:1(1-29)Online publication date: 13-Jan-2025
https://dl.acm.org/doi/10.1145/3702236
(2017)A probabilistic mix-critical task scheduling algorithm for wireless networked control systemInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2017.08746210:6(453-462)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1504/IJHPCN.2017.087462
Li CLin MYang LDing C(2014)Integrating the enriched feature with machine learning algorithms for human movement and fall detectionThe Journal of Supercomputing10.1007/s11227-013-1056-y67:3(854-865)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1007/s11227-013-1056-y
Show More Cited By

Real-time scheduling with quality of security constraints

Recommendations

EDZL Schedulability Analysis in Real-Time Multicore Scheduling

In real-time systems, correctness depends not only on functionality but also on timeliness. A great number of scheduling theories have been developed for verification of the temporal correctness of jobs (software) in such systems. Among them, the ...
Analysis on quantum-based fixed priority scheduling of real-time tasks
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication

Fixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing ...
Performance Analysis of Real-Time Scheduling Algorithms
ICICSE '20: Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering

Real-time systems are intensively used nowadays. Scheduling algorithms are very important to manage the scheduling of tasks in real-time systems. In this paper we give an overview on the real-time scheduling techniques for uniprocessors and ...

Comments

Information & Contributors

Information

Published In

cover image International Journal of High Performance Computing and Networking

International Journal of High Performance Computing and Networking Volume 4, Issue 3/4

August 2006

103 pages

ISSN:1740-0562

EISSN:1740-0570

Issue’s Table of Contents

Publisher

Inderscience Publishers

Geneva 15, Switzerland

Publication History

Published: 01 August 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Senapati DBhagat PKarfa CSarkar A(2025)SHIELD: Security-Aware Scheduling for Real-Time DAGs on Heterogeneous SystemsACM Transactions on Cyber-Physical Systems10.1145/37022369:1(1-29)Online publication date: 13-Jan-2025
https://dl.acm.org/doi/10.1145/3702236
(2017)A probabilistic mix-critical task scheduling algorithm for wireless networked control systemInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2017.08746210:6(453-462)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1504/IJHPCN.2017.087462
Li CLin MYang LDing C(2014)Integrating the enriched feature with machine learning algorithms for human movement and fall detectionThe Journal of Supercomputing10.1007/s11227-013-1056-y67:3(854-865)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1007/s11227-013-1056-y
Hussain HMalik SHameed AKhan SBickler GMin-Allah NQureshi MZhang LYongji WGhani NKolodziej JZomaya AXu CBalaji PVishnu APinel FPecero JKliazovich DBouvry PLi HWang LChen DRayes A(2013)A survey on resource allocation in high performance distributed computing systemsParallel Computing10.1016/j.parco.2013.09.00939:11(709-736)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.parco.2013.09.009
Nayak SPadhy SPanigrahi S(2012)A novel algorithm for dynamic task schedulingFuture Generation Computer Systems10.1016/j.future.2011.12.00128:5(709-717)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1016/j.future.2011.12.001
Sivanandam SVisalakshi P(2009)Dynamic task scheduling with load balancing using parallel orthogonal particle swarm optimisationInternational Journal of Bio-Inspired Computation10.1504/IJBIC.2009.0247261:4(276-286)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1504/IJBIC.2009.024726
Yau SYan MHuang D(2007)Design of service-based systems with adaptive tradeoff between security and service delayProceedings of the 4th international conference on Autonomic and Trusted Computing10.5555/2394798.2394814(103-113)Online publication date: 11-Jul-2007
https://dl.acm.org/doi/10.5555/2394798.2394814
Xie TQin X(2006)Scheduling Security-Critical Real-Time Applications on ClustersIEEE Transactions on Computers10.1109/TC.2006.11055:7(864-879)Online publication date: 1-Jul-2006
https://dl.acm.org/doi/10.1109/TC.2006.110

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents