| 2/2017 - 16 | View TOC | « Previous Article | Next Article » |
Real-Time Scheduling for Preventing Information Leakage with Preemption OverheadsBAEK, H.   , LEE, J. , LEE, J. , KIM, P. , KANG, B. B. |
Extra paper information in    |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (1,246 KB) | Citation | Downloads: 1,193 | Views: 3,485 |
Author keywords
embedded software, real-time systems, scheduling algorithms, security, system analysis and design
References keywords
time(53), systems(51), real(48), scheduling(19), security(15), analysis(13), embedded(9), tasks(6), task(6), rtss(6)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2017-05-31
Volume 17, Issue 2, Year 2017, On page(s): 123 - 132
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2017.02016
Web of Science Accession Number: 000405378100016
SCOPUS ID: 85020105673
Abstract
Real-time systems (RTS) are characterized by tasks executing in a timely manner to meet its deadlines as a real-time constraint. Most studies of RTS have focused on these criteria as primary design points. However, recent increases in security threats to various real-time systems have shown that enhanced security support must be included as an important design point, retro-fitting such support to existing systems as necessary. In this paper, we propose a new pre-flush technique referred to as flush task reservation for FP scheduling (FTR-FP) to conditionally sanitize the state of resources shared by real-time tasks by invoking a flush task (FT) in order to mitigate information leakage/corruption of real-time systems. FTR-FP extends existing works exploiting FTs to be applicable more general scheduling algorithms and security model. We also propose modifications to existing real-time scheduling algorithms to implement a pre-flush technique as a security constraint, and analysis technique to verify schedulability of the real-time scheduling. For better analytic capability, our analysis technique provides a count of the precise number of preemptions that a task experiences offline. Our evaluation results demonstrate that our proposed schedulability analysis improves the performance of existing scheduling algorithms in terms of schedulability and preemption cost. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] A. Biondi, G. Buttazzo, M. Bertogna, "Schedulability analysis of hierarchical real-time systems under shared resources," IEEE Transactions on Computers, vol. 65, issue. 5, pp. 1593 1605, 2016. [CrossRef] [Web of Science Times Cited 24] [SCOPUS Times Cited 31] [2] A. Melani, et al., "Exact response time analysis for fixed priority memory-processor co-scheduling," IEEE Transactions on Computers, vol. PP, issue. 99, pp. 1 110, 2016. [CrossRef] [Web of Science Times Cited 7] [SCOPUS Times Cited 12] [3] A. Melani, M. Bertogna, V. Bonifaci, A. M. Spaccamela, G. Buttazzo, "Schedulability analysis of conditional parallel task graphs in multicore systems," IEEE Transactions on Computers, vol. 66, issue. 2, pp. 339 353, 2017. [CrossRef] [Web of Science Times Cited 43] [SCOPUS Times Cited 53] [4] X. Hua, C. Guo, H. Wu, D. Lautner, S. Ren, "Analysis for real-time task set on resource with performance degradation and dual-level periodic rejuvenations," IEEE Transactions on Computers, vol. 66, issue. 3, pp. 553 559, 2017. [CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 11] [5] M. Bambagini, M. Marinoni, H. Aydin, G. Buttazzo, "Energy-aware scheduling for real-time systems: a survey," ACM Transactions on Embedded Computing Systems, vol. 15, no. 7, issue. 1, pp. 1 33, 2016. [CrossRef] [Web of Science Times Cited 131] [SCOPUS Times Cited 161] [6] M. Haque, H. Aydin, D. Zhu, "On reliability management of energy-aware real-time systems through task replication," IEEE Transactions on Parallel and Distributed Systems, vol. 28, issue. 3, pp. 813 825, 2017. [CrossRef] [Web of Science Times Cited 97] [SCOPUS Times Cited 111] [7] S. Mittal, "A survey of techniques for improving energy efficiency in embedded computing systems," International Journal of Computer Aided Engineering and Technology, vol. 6, issue. 4, pp. 1 12, 2014. [CrossRef] [SCOPUS Times Cited 115] [8] C. Krishna, "Fault-tolerant scheduling in homogeneous real-time systems," ACM Computing Surveys, vol. 46, issue. 4, no. 48, pp. 1 48, 2014. [CrossRef] [Web of Science Times Cited 42] [SCOPUS Times Cited 56] [9] H. M. Mora, D. Gil, J. F. C. López, M. T. S. Pont, "Flexible framework for real-time embedded systems based on mobile cloud computing paradigm," Mobile Information Systems, vol. 2015, id. 652462, pp. 1 14, 2015. [CrossRef] [Web of Science Times Cited 16] [SCOPUS Times Cited 25] [10] A. Saifullah, et al., "Parallel real-time scheduling of DAGs," IEEE Transactions on Parallel and Distributed Systems, vol. 25, issue. 12, pp. 3242 3252, 2014. [CrossRef] [Web of Science Times Cited 101] [SCOPUS Times Cited 147] [11] J. Leung, J. Whitehead, "On the complexity of fixed-priority scheduling of periodic real-time tasks," Performance Evaluation, vol. 2, pp. 237 250, 1982. [CrossRef] [Web of Science Times Cited 511] [SCOPUS Times Cited 756] [12] S. Vestal, "Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance," IEEE Real-Time Systems Symposium (RTSS), 2007, pp. 239 243. [CrossRef] [Web of Science Times Cited 134] [SCOPUS Times Cited 185] [13] H. Chwa, et al., "Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines," IEEE Real-Time Systems Symposium (RTSS), pp. 51 62, 2012. [CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 14] [14] N. C. Audsley, "On priority assignment in fixed priority scheduling," Information Processing Letters, vol. 79-1, pp. 39 44, 2001. [CrossRef] [Web of Science Times Cited 176] [SCOPUS Times Cited 200] [15] N. Guan, M. Stigge, W. Yi, Ge Yu, "New Response Time Bounds for Fixed Priority Multiprocessor Scheduling," IEEE Real-Time Systems Symposium (RTSS), pp. 51 62, 2009. [CrossRef] [Web of Science Times Cited 88] [SCOPUS Times Cited 140] [16] K. Koscher, et al., "Experimental security analysis of a modern automobile," IEEE Symposium on Security and Privacy (SP), pp. 447 462, 2010. [CrossRef] [Web of Science Times Cited 1018] [SCOPUS Times Cited 1494] [17] K. Koscher, A. Czeskis, F. Roesner, "Experimental Security Analysis of a Modern Automobile," IEEE Symposium on Security and Privacy (SP), pp. 447 462, 2010. [CrossRef] [Web of Science Times Cited 1018] [SCOPUS Times Cited 1494] [18] K. Fisher, " Using formal methods to enable more secure vehicles: DARPA's HACMS program," ACM SIGPLAN international conference on Functional programming, pp. 1 1, 2014. [CrossRef] [19] J. Pleban, R. Band, R. Creutzburg, "Hacking and securing the AR.Drone 2.0 quadcopter: Investigations for improving the security of a toy," SPIE - The International Society for Optical Engineering, pp. 1 12, 2014. [CrossRef] [Web of Science Times Cited 38] [SCOPUS Times Cited 81] [20] J. Son, J. Alves-Foss, "Covert timing channel analysis of rate monotonic real-time scheduling algorithm in mls systems," IEEE Information Assurance Workshop, pp. 361 368, 2006. [CrossRef] [Web of Science Times Cited 23] [21] J. Li, et al., "Analysis of federated and global scheduling for parallel real-time tasks," Euromicro Conference on Real-Time Systems (ECRTS), pp. 85 96, 2014. [CrossRef] [Web of Science Times Cited 127] [SCOPUS Times Cited 190] [22] R. Pathan, "Real-time scheduling algorithm for safety-critical systems on faulty multicore environments," Real-Time Systems, vol. 53, issue. 1, pp 45 81, 2017. [CrossRef] [Web of Science Times Cited 26] [SCOPUS Times Cited 28] [23] A. Melani, R. Mancuso, D. Cullina, M. Caccamo, L. Thiele, "Optimizing resource speed for two-stage real-time tasks," Real-Time Systems, vol. 53, issue. 1, pp 82 120, 2017. [CrossRef] [Web of Science Times Cited 1] [SCOPUS Times Cited 1] [24] J. Goossens, E. Grolleau, L. Grosjean, "Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms," Real-Time Systems, vol. 52, issue. 6, pp. 808 832, 2016. [CrossRef] [Web of Science Times Cited 16] [SCOPUS Times Cited 27] [25] J. Chen, "Federated scheduling admits no constant speedup factors for constrained-deadline DAG task systems," Real-Time Systems, vol. 52, issue. 6, pp. 833 838, 2016. [CrossRef] [Web of Science Times Cited 17] [SCOPUS Times Cited 20] [26] E. Massa, G. Lima, P. Regnier, G. Levin, S. Brandt, "Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems," Real-Time Systems, vol. 52, issue 5, pp. 566 597, 2016. [CrossRef] [Web of Science Times Cited 15] [SCOPUS Times Cited 21] [27] S. Altmeyer, R. Douma, W. Lunniss, R. Davis, "On the effectiveness of cache partitioning in hard real-time systems," Real-Time Systems, vol. 52, issue. 5, pp. 598 643, 2016. [CrossRef] [Web of Science Times Cited 17] [SCOPUS Times Cited 29] [28] M. Xu, et al., "Cache-aware compositional analysis of real-time multicore virtualization platforms," Real-Time Systems, vol. 51, issue. 6, pp. 675 723, 2015. [CrossRef] [Web of Science Times Cited 14] [SCOPUS Times Cited 16] [29] H. Zeng, M. Natale, "Computing periodic request functions to speed-up the analysis of non-cyclic task models," Real-Time Systems, vol. 51, issue 4, pp. 360 394, 2015. [CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 6] [30] Jing Li, et al., "Global EDF scheduling for parallel real-time tasks," Real-Time Systems, vol. 51, issue 4, pp. 395 439, 2015. [CrossRef] [Web of Science Times Cited 36] [SCOPUS Times Cited 46] [31] S. Mohan, M. Yoon, R. Pellizzoni, R. Bobba, "Real-time systems security through scheduler constraints," Euromicro Conference on Real-Time Systems (ECRTS), pp. 129 140, 2014. [CrossRef] [Web of Science Times Cited 42] [SCOPUS Times Cited 47] [32] R. Pellizzoni, et al., "A generalized model for preventing information leakage in hard real-time systems," IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 271 282, 2015. [CrossRef] [SCOPUS Times Cited 41] [33] H. Baek, J. Lee, Y. Lee, H. Yoon, "Preemptive real-time scheduling incorporating security constraint for cyber physical systems," IEICE Transactions on Information and Systems, vol. E99-D, no. 8, pp. 2121 2130, 2016. [CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 9] [34] C. Liu, J. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment," Journal of ACM, vol. 20 1, pp. 4661, 1973. [CrossRef] [SCOPUS Times Cited 6633] [35] M. Stigge, W. Yi, "Combinatorial abstraction refinement for feasibility analysis of static priorities," Real-Time Systems, vol. 51, issue. 6, pp. 639 674, 2015. [CrossRef] [Web of Science Times Cited 15] [SCOPUS Times Cited 19] [36] M. Jeseph, P. Pandya, "Finding response times in a real-time system," BCS Computer Journal, vol. 29-55, pp. 390 395, 1986. [CrossRef] [Web of Science Times Cited 598] [SCOPUS Times Cited 848] [37] W. Kang, J. Chung, "Energy-efficient response time management for embedded databases," Real-Time Systems, vol. 53, issue. 2, pp. 228 253, 2017. [CrossRef] [Web of Science Times Cited 7] [SCOPUS Times Cited 9] [38] A. Erlebach, "Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow," Jornal of Scheduling, vol. 7, pp. 233241, 2004. [CrossRef] [Web of Science Times Cited 13] [SCOPUS Times Cited 15] [39] P. Yomsi, Y. Sorel, "Extending rate monotonic analysis with exact cost of preemptions for hard real-time systems," Euromicro Conference on Real-Time Systems (ECRTS), pp. 280 290, 2007. [CrossRef] [Web of Science Times Cited 17] [SCOPUS Times Cited 30] [40] T. Xie, X. Qin, "Improving security for periodic tasks in embedded systems through scheduling," ACM Transactions on Embedded Computing Systems, vol. 6-3, 2007. [CrossRef] [Web of Science Times Cited 48] [SCOPUS Times Cited 69] [41] M. Lin, et al., "Static security optimization for real-time systems," IEEE Transactions on Industrial Informatics, vol. 5-1, pp. 22 37, 2009. [CrossRef] [Web of Science Times Cited 71] [SCOPUS Times Cited 93] [42] Q. Ahmed, S. Vrbsky, "Maintaining security in firm real-time database systems," Conference on Computer Security Applications, pp. 83 90, 1998. [CrossRef] [Web of Science Times Cited 9] [SCOPUS Times Cited 17] [43] S. Son, "Supporting timeliness and security in real-time database systems," Euromicro Workshop on Real-Time Systems, 1997, pp. 266 273. [CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 6] [44] S. Son, C. Chaney, N. Thomlinson, "Partial security policies to support timeliness in secure real-time databases," IEEE Symposium on Security and Privacy (SP), pp. 136 147, 1998. [CrossRef] [Web of Science Times Cited 16] [45] S. Mohan, et al., "S3a: secure system simplex architecture for enhanced security and robustness of cyber physical systems," ACM international conference on High confidence networked systems, pp. 65 74, 2013. [CrossRef] [SCOPUS Times Cited 73] [46] G. Suh, J. Lee, D. Zhang, S. Devadas, "Secure program execution via dynamic information flow tracking," International conference on Architectural support for programming languages and operating systems, pp. 85 96, 2004. [CrossRef] [47] M. Yoon, S. Mohan, J. Choi, J. Kim, L. Sha, "Securecore: A multicore based intrusion detection architecture for real-time embedded systems view document," Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 21 31, 2013. [CrossRef] [SCOPUS Times Cited 77] [48] C. Zimmer, B. Bhat, F. Mueller, S. Mohan, "Time-based intrusion detection in cyber-physical systems," ACM/IEEE International Conference on Cyber-Physical Systems, pp. 109 118, 2010. [CrossRef] [SCOPUS Times Cited 96] Web of Science® Citations for all references: 4,609 TCR SCOPUS® Citations for all references: 13,552 TCR Web of Science® Average Citations per reference: 94 ACR SCOPUS® Average Citations per reference: 277 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-11-19 18:02 in 355 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
