An interactive jobs schedule strategy in virtualized compute centers
Jian He · Journal of Wuhan Polytechnic University · 2010
The paper describes a scheduling algorithm for the virtual computing center,which is aimed at strengthening the timely allocation of resources for the interactive tasks.The algorithm is based on preemptive scheduling strategy and can quickly allocate resources to interactive tasks,and enable tasks whose resources have been preempted easily to resume running.Through computing center testing to run simulated environment,test results show that: the scheduling algorithm have improved not only timely allocation of resources interactive operations significantly,and improved resource utilization,but also greatly shortened the response time of a batch job.