半虚拟化I/O模型的KVM虚拟机域间通信优化方法

计算机科学与探索 ›› 2011, Vol. 5 ›› Issue (12): 1114-1120.

半虚拟化I/O模型的KVM虚拟机域间通信优化方法

丁圣阁, 马汝辉, 梁阿磊, 管海兵

1. 上海交通大学软件学院, 上海 200001
2. 上海交通大学计算机科学与工程系, 上海 200001

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-12-01 发布日期:2011-12-01

Optimization for Inter-VMs Communication on KVM with Para-Virtualized I/O Model

DING Shengge, MA Ruhui, LIANG Alei, GUAN Haibing

1. School of Software, Shanghai Jiaotong University, Shanghai 200001, China
2. Department of Computer Science & Engineering, Shanghai Jiaotong University, Shanghai 200001, China

Received:1900-01-01 Revised:1900-01-01 Online:2011-12-01 Published:2011-12-01

摘要/Abstract

摘要： 提出了一种半虚拟化网络模型来优化虚拟机域间通信的性能, 通过共享内存建立通信通道来打破虚拟机之前的隔离屏障, 减少在数据传输过程中的拷贝次数。基于内核虚拟机(kernel-based virtual machine, KVM)半虚拟化框架编程接口的实现方法可以简化设备I/O的模拟, 减少特权指令模拟所需的根-非根模式的切换, 提供高效的I/O模拟, 并向客户提供标准的网络接口, 使通信通道透明。利用共享内存的通信方法, 其性能接近进程间通信。对系统原型进行测试, 结果表明域间通信的吞吐量和响应延时都得到了较好的优化。

关键词: 半虚拟化, 域间通信, 共享内存

Abstract: This paper presents a para-virtualized network model to optimize inter-VMs communication performance, which is designed as a shared-memory-based channel crossing barriers to reduce data copies in virtualization systems. The implementation of kernel-based virtual machine (KVM) with para-virtualized I/O device emulation can simplify I/O operation and reduce traps which incur switches between root and non-root modes in KVM. It provides an efficient I/O path and this communication channel is transparent to guest applications while the front-end driver has a standard interface for kernel. This method can achieve performance nearly at inter-processes communication level. The test results on prototype show that the throughput and latency of inter-VMs communication are improved.

Key words: para-virtualization, inter-VMs communication, shared memory

丁圣阁, 马汝辉, 梁阿磊, 管海兵. 半虚拟化I/O模型的KVM虚拟机域间通信优化方法[J]. 计算机科学与探索, 2011, 5(12): 1114-1120.

DING Shengge, MA Ruhui, LIANG Alei, GUAN Haibing. Optimization for Inter-VMs Communication on KVM with Para-Virtualized I/O Model[J]. Journal of Frontiers of Computer Science and Technology, 2011, 5(12): 1114-1120.