Task scheduling based on virtual machine matching in clouds
Document Type
Conference Proceeding
Publication Date
7-1-2017
Abstract
This work proposes a task scheduling method based on virtual machine (VM) matching in clouds. Its objectives are 1) to maximize task scheduling performance and 2) to minimize non-reasonable task allocation, e.g., a simple task to a high-performance VM and thus causing resource waste. A job classifier is utilized to classify tasks and match to a most suitable VM. This work uses the historical data to pre-create VMs of different types. This can save time of creating VMs during task scheduling. Tasks are efficiently matched with concrete VMs dynamically. Task scheduling is accordingly conducted. Experimental results with the Google Cluster Trace dataset show that the proposed method can effectively improve the cloud's task scheduling performance and achieve desired load balancing among various virtual machines in comparison with some existing methods.
Identifier
85044974197 (Scopus)
ISBN
[9781509067800]
Publication Title
IEEE International Conference on Automation Science and Engineering
External Full Text Location
https://doi.org/10.1109/COASE.2017.8256171
e-ISSN
21618089
ISSN
21618070
First Page
618
Last Page
623
Volume
2017-August
Grant
61201252
Fund Ref
National Natural Science Foundation of China
Recommended Citation
Zhang, Peiyun and Zhou, Mengchu, "Task scheduling based on virtual machine matching in clouds" (2017). Faculty Publications. 9486.
https://digitalcommons.njit.edu/fac_pubs/9486
