Christine Niyizamwiyitira
ABSTRACT
There are two levels of scheduling in real-time applications executing in a virtualized environment: traditional real-time scheduling of the tasks in the real-time application inside a Virtual Machine (VM), and scheduling of different VMs on the hypervisor level. In order to save more resources, we propose to schedule VMs that contains hard real-time application in an optimistic manner by considering VMs as a whole instead of being isolated. Based on the properties of the real-time applications inside the VMs, we obtain (worst-case) execution times and periods for the VMs containing the real-time applications. A VM's period will be chosen according to the requirement of the application that runs inside that VM. Through simulation, we investigate the impact of the length of different VMs' periods whether the VM context switching overhead is present or not. The tradeoff between resources consumption and period's length is presented. The results show that longer periods are better at handling higher overhead even with higher number of VMs that share the same hardware.
- L. Abeni and T. Cucinotta, "Efficient virtualisation of real-time activities," in Service-Oriented Computing and Applications (SOCA), 2011 IEEE International Conference, 2011, pp. 1--4. Google Scholar
Digital Library
- L. Lundberg and S. Shirinbab, "Real-time scheduling in cloud-based virtualized software systems," in Proceedings of the Second Nordic Symposium on Cloud Computing & Internet Technologies, 2013, pp. 54--58. Google ScholarDigital Library
- Y. Ren, L. Liu, Q. Zhang, Q. Wu, J. Wu, J. Kong, J. Guan, and H. Dai, "Residency-Aware Virtual Machine Communication Optimization: Design Choices and Techniques," in Proceedings of the 2013 IEEE Sixth International Conference on Cloud Computing, Washington, DC, USA, 2013, pp. 823--830. Google ScholarDigital Library
- M. Kurtadikar, A. Patil, P. Toshniwal, and J. Abraham, "An Inter-VM Communication Model Supporting Live Migration," in 2013 International Conference on Cloud Ubiquitous Computing Emerging Technologies (CUBE), 2013, pp. 63--68. Google ScholarDigital Library
- C. Niyizamwiyitira and L. Lundberg, "Real-Time Systems Scheduling of Multiple Virtual Machines." {Online}. Available: http://www.bth.se/people/cnw.nsf/pages/real-time-scheduling-virtualization. {Accessed: 09-Jun-2015}.Google Scholar
- C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment," J. ACM, vol. 20, no. 1, pp. 46--61, 1973. Google ScholarDigital Library
- L. Lundberg, "Analyzing fixed-priority global multiprocessor scheduling," in Real-Time and Embedded Technology and Applications Symposium, 2002. Proceedings. Eighth IEEE, 2002, pp. 145--153. Google ScholarDigital Library
- D. Seto, J. P. Lehoczky, L. Sha, and K. G. Shin, "On task schedulability in real-time control systems," in Real-Time Systems Symposium, 1996., 17th IEEE, 1996, pp. 13--21. Google ScholarDigital Library
- D. Seto, J. P. Lehoczky, and L. Sha, "Task period selection and schedulability in real-time systems," in Real-Time Systems Symposium, 1998. Proceedings., The 19th IEEE, 1998, pp. 188--198. Google ScholarDigital Library
- T. Chantem, X. Wang, M. D. Lemmon, and X. S. Hu, "Period and deadline selection for schedulability in real-time systems," in Real-Time Systems, 2008. ECRTS'08. Euromicro Conference on, 2008, pp. 168--177. Google ScholarDigital Library
- T. Cucinotta, G. Anastasi, and L. Abeni, "Respecting Temporal Constraints in Virtualised Services.," in COMPSAC (2), 2009, pp. 73--78. Google ScholarDigital Library
- I. Shin and I. Lee, "Periodic resource model for compositional real-time guarantees," in Real-Time Systems Symposium, 2003. RTSS2003. 24th IEEE, 2003, pp. 2--13. Google ScholarDigital Library
- J. Lee, S. Xi, S. Chen, L. T. Phan, C. Gill, I. Lee, C. Lu, and O. Sokolsky, "Realizing compositional scheduling through virtualization," in Real-Time and Embedded Technology and Applications Symposium (RTAS), 2012 IEEE 18th, 2012, pp. 13--22. Google ScholarDigital Library
- S. Xi, C. Lu, C. Gill, M. Xu, L. T. Phan, I. Lee, and O. Sokolsky, "Global Real-Time Multi-Core Virtual Machine Scheduling in Xen," Washington University Technical Report, Tech. Rep, 2013.Google Scholar
- A. Burns and A. J. Wellings, Real-time systems and programming languages: Ada 95, real-time Java, and real-time POSIX. Pearson Education, 2001. Google ScholarDigital Library
- E. Bini, T. H. C. Nguyen, P. Richard, and S. K. Baruah, "A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines," IEEE Trans. Comput., vol. 58, no. 2, pp. 279--286, Feb. 2009. Google ScholarDigital Library
- S. Chen, L. T. Phan, J. Lee, I. Lee, and O. Sokolsky, "Removing abstraction overhead in the composition of hierarchical real-time systems," in Real-Time and Embedded Technology and Applications Symposium (RTAS), 2011 17th IEEE, 2011, pp. 81--90. Google ScholarDigital Library
- L. T. Phan, M. Xu, J. Lee, I. Lee, and O. Sokolsky, "Overhead-aware compositional analysis of real-time systems," in Real-Time and Embedded Technology and Applications Symposium (RTAS), 2013 IEEE 19th, 2013, pp. 237--246. Google ScholarDigital Library
- E. Bini and G. C. Buttazzo, "Measuring the performance of schedulability tests," Real-Time Syst., vol. 30, no. 1--2, pp. 129--154, 2005. Google ScholarDigital Library
- M. Kutil, P. Sucha, R. Capek, and Z. Hanzalek, "Optimization and scheduling toolbox," Matlab---Modelling Program. Simul, pp. 239--260, 2010.Google Scholar
- "TORSCHE Scheduling Toolbox for Matlab." {Online}. Available: http://rtime.felk.cvut.cz/scheduling-toolbox/. {Accessed: 07-May-2014}.Google Scholar
Index Terms
- Period assignment in real-time scheduling of multiple virtual machines
Recommendations
Real-time scheduling in cloud-based virtualized software systems
NordiCloud '13: Proceedings of the Second Nordic Symposium on Cloud Computing & Internet TechnologiesThe number of applications that use virtualized cloud-based systems is growing, and one would like to use this kind of systems also for real-time applications with hard deadlines. There is scheduling on two levels in real-time applications executing in ...
A lock-aware virtual machine scheduling scheme for synchronization performance
In virtualized environments, multiprocessor virtual machines encounter synchronization problems such as lock holder preemption (LHP) and lock waiter preemption (LWP). When the issue happens, a virtual CPU (VCPU) waiting for such locks spins for an ...
Dynamic adaptive scheduling for virtual machines
HPDC '11: Proceedings of the 20th international symposium on High performance distributed computingWith multi-core processors becoming popular, exploiting their computational potential becomes an urgent matter. The functionality of multiple standalone computer systems can be aggregated into a single hardware computer by virtualization, giving ...
Comments