Abstract
Cyber and physical system is a deeply embedded distributed real-time system whose real time characteristic is the critical property of CPS. In order to improve the real-time performance, most algorithms use the preemptive scheduling model. However, the preemptive scheduling easily leads to task switching frequently, which increases communication overhead. Meanwhile, parallel real time tasks will compete the memory, which affects the timeliness of CPS badly. Aiming at this problem, this paper proposed the real time scheduling and the dynamic memory allocation methods based on reservation, which can maximize the low priority tasks executive time and effectively avoid the memory competition. The experimental results show that the algorithm can effectively reduce the task switching frequency and improve the CPS real-time performance in the limited memory resources.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lee, E.A.: Cyber physical systems: Design challenges. In: 2008 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC), pp. 363–369. IEEE (2008)
Lee, E.A., Seshia, S.A.: Introduction to embedded systems: A cyber-physical systems approach. Lee & Seshia (2011)
Li, J., Gao, H., Yu, B.: The concept, characteristics, challenges and research progress of CPS. In: 2009 Computer Science and Technology Development Report, Beijing, CCF, pp. 1–17 (2010)
Li, R., Xie, Y., Li, R., Li, L.: Survey of Cyber-Physical Systems 49(6), 1149–1161 (2012)
Mao, X., Miao, X., He, Y., et al.: Citysee: Urban CO2 monitoring with sensors. In: IEEE INFOCOM, Orlando, FL, USA (2012)
Liu, Y., He, Y., Li, M., et al.: Does wireless sensor network scale? A measurement study on GreenOrbs. In: 2011 Proceedings IEEE INFOCOM, pp. 873–881. IEEE (2011)
Du, X.Z., Qiao, J.Z., Lin, S.K., et al.: The Design of Node Operating System for Cyber Physical Systems. Procedia Engineering 29, 3717–3721 (2012)
MinSeong, K., Andy, W.: Applying fixed-priority preemptive scheduling with preemption threshold to asynchronous event handling in the RTSJ. Concurrency and Computation: Practice and Experience 23(14), 1609–1622 (2011)
Ding, W., Guo, R.: Preemption Threshold Scheduling Algorithm with Higher Fault-Tolerant Priority. Journal of Software 22(12), 2894–2904 (2011)
Keskin, U.: Exact response-time analysis for fixed-priority preemption-threshold scheduling. In: Proceedings of Emerging Technologies and Factory Automation (ETFA), Bilbao, pp. 1–4. IEEE Press (2010)
Chen, Y., Wang, X., Zhao, H., et al.: Ready queue optimization research in task scheduling. Journal of System Simulation 18(4), 877–882 (2006)
Eswaran, A., Rajkumar, R.: Energy-aware memory firewalling for QoS-sensitive applications. In: Proceedings of the Euromicro Conference on Real-Time Systems, pp. 11–20. IEEE Press, Palma de Mallorca (2005)
del Mar Gallardo, M., Merino, P., Sanán, D.: Model Checking Dynamic Memory Allocation in Operating Systems. Journal of Automated Reasoning 42(2), 229–264 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, B. (2014). Research on a CPS Real Time Scheduling and Memory Allocation Method Based Reservation. In: Sun, L., Ma, H., Hong, F. (eds) Advances in Wireless Sensor Networks. CWSN 2013. Communications in Computer and Information Science, vol 418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54522-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-54522-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54521-4
Online ISBN: 978-3-642-54522-1
eBook Packages: Computer ScienceComputer Science (R0)
