Period assignment in real-time scheduling of multiple virtual machines

Christine Niyizamwiyitira, L. Lundberg
{"title":"Period assignment in real-time scheduling of multiple virtual machines","authors":"Christine Niyizamwiyitira, L. Lundberg","doi":"10.1145/2857218.2857262","DOIUrl":null,"url":null,"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.","PeriodicalId":234238,"journal":{"name":"Proceedings of the 7th International Conference on Management of computational and collective intElligence in Digital EcoSystems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Management of computational and collective intElligence in Digital EcoSystems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2857218.2857262","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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.
多虚拟机实时调度中的周期分配
在虚拟化环境中执行的实时应用程序有两种级别的调度:一种是对虚拟机内的实时应用程序中的任务进行传统的实时调度,另一种是在虚拟机管理程序级别对不同的虚拟机进行调度。为了节省更多的资源,我们建议对包含硬实时应用的虚拟机采取乐观的调度方式,将虚拟机作为一个整体而不是孤立地考虑。根据虚拟机内部实时应用的属性,得到包含实时应用的虚拟机的执行时间和周期(最坏情况)。虚拟机的周期将根据在该虚拟机内运行的应用程序的需求来选择。通过仿真,我们研究了不同虚拟机周期长度对虚拟机上下文切换开销是否存在的影响。提出了资源消耗与周期长度之间的权衡。结果表明,即使在共享相同硬件的虚拟机数量较多的情况下,较长的周期也能更好地处理较高的开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书