Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2012, Vol. 13 Issue (3): 155-177    DOI: 10.1631/jzus.C1100217
    
Task mapper and application-aware virtual machine scheduler oriented for parallel computing
Jing Zhang, Xiao-jun Chen, Jun-huai Li, Xiang Li
School of Computer Science and Engineering, Xi'an University of Technology, Xi'an 710048, China; State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an 710048, China
Task mapper and application-aware virtual machine scheduler oriented for parallel computing
Jing Zhang, Xiao-jun Chen, Jun-huai Li, Xiang Li
School of Computer Science and Engineering, Xi'an University of Technology, Xi'an 710048, China; State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an 710048, China
 全文: PDF 
摘要: We design a task mapper TPCM for assigning tasks to virtual machines, and an application-aware virtual machine scheduler TPCS oriented for parallel computing to achieve a high performance in virtual computing systems. To solve the problem of mapping tasks to virtual machines, a virtual machine mapping algorithm (VMMA) in TPCM is presented to achieve load balance in a cluster. Based on such mapping results, TPCS is constructed including three components: a middleware supporting an application-driven scheduling, a device driver in the guest OS kernel, and a virtual machine scheduling algorithm. These components are implemented in the user space, guest OS, and the CPU virtualization subsystem of the Xen hypervisor, respectively. In TPCS, the progress statuses of tasks are transmitted to the underlying kernel from the user space, thus enabling virtual machine scheduling policy to schedule based on the progress of tasks. This policy aims to exchange completion time of tasks for resource utilization. Experimental results show that TPCM can mine the parallelism among tasks to implement the mapping from tasks to virtual machines based on the relations among subtasks. The TPCS scheduler can complete the tasks in a shorter time than can Credit and other schedulers, because it uses task progress to ensure that the tasks in virtual machines complete simultaneously, thereby reducing the time spent in pending, synchronization, communication, and switching. Therefore, parallel tasks can collaborate with each other to achieve higher resource utilization and lower overheads. We conclude that the TPCS scheduler can overcome the shortcomings of present algorithms in perceiving the progress of tasks, making it better than schedulers currently used in parallel computing.
关键词: Virtual machineVirtualizationApplication-awareParallel computingVirtual machine mappingCredit algorithmVirtual machine scheduling    
Abstract: We design a task mapper TPCM for assigning tasks to virtual machines, and an application-aware virtual machine scheduler TPCS oriented for parallel computing to achieve a high performance in virtual computing systems. To solve the problem of mapping tasks to virtual machines, a virtual machine mapping algorithm (VMMA) in TPCM is presented to achieve load balance in a cluster. Based on such mapping results, TPCS is constructed including three components: a middleware supporting an application-driven scheduling, a device driver in the guest OS kernel, and a virtual machine scheduling algorithm. These components are implemented in the user space, guest OS, and the CPU virtualization subsystem of the Xen hypervisor, respectively. In TPCS, the progress statuses of tasks are transmitted to the underlying kernel from the user space, thus enabling virtual machine scheduling policy to schedule based on the progress of tasks. This policy aims to exchange completion time of tasks for resource utilization. Experimental results show that TPCM can mine the parallelism among tasks to implement the mapping from tasks to virtual machines based on the relations among subtasks. The TPCS scheduler can complete the tasks in a shorter time than can Credit and other schedulers, because it uses task progress to ensure that the tasks in virtual machines complete simultaneously, thereby reducing the time spent in pending, synchronization, communication, and switching. Therefore, parallel tasks can collaborate with each other to achieve higher resource utilization and lower overheads. We conclude that the TPCS scheduler can overcome the shortcomings of present algorithms in perceiving the progress of tasks, making it better than schedulers currently used in parallel computing.
Key words: Virtual machine    Virtualization    Application-aware    Parallel computing    Virtual machine mapping    Credit algorithm    Virtual machine scheduling
收稿日期: 2011-07-27 出版日期: 2012-03-01
CLC:  TP391  
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章  
Jing Zhang
Xiao-jun Chen
Jun-huai Li
Xiang Li

引用本文:

Jing Zhang, Xiao-jun Chen, Jun-huai Li, Xiang Li. Task mapper and application-aware virtual machine scheduler oriented for parallel computing. Front. Inform. Technol. Electron. Eng., 2012, 13(3): 155-177.

链接本文:

http://www.zjujournals.com/xueshu/fitee/CN/10.1631/jzus.C1100217        http://www.zjujournals.com/xueshu/fitee/CN/Y2012/V13/I3/155

[1] Ke-shi GE, Hua-you SU, Dong-sheng LI, Xi-cheng LU. Efficient parallel implementation of a density peaks clustering algorithm on graphics processing unit[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(7): 915-927.
[2] Bo Lu, Jian-ya Chen, Hong-yan Cui, Tao Huang, Yun-jie Liu. A virtual network mapping algorithm based on integer programming[J]. Front. Inform. Technol. Electron. Eng., 2013, 14(12): 899-908.
[3] Xiao-ling Li, Huai-min Wang, Chang-guo Guo, Bo Ding, Xiao-yong Li, Wen-qi Bi, Shuang Tan. Topology awareness algorithm for virtual network mapping[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(3): 178-186.
[4] Razieh Sadat Sadjady, Kamran Zamanifar. A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(6): 455-463.
[5] Dan Wu, Xue-cheng Zou, Kui Dai, Jin-li Rao, Pan Chen, Zhao-xia Zheng. Implementation and evaluation of parallel FFT on Engineering and Scientific Computation Accelerator (ESCA) architecture[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(12): 976-989.