DocumentCode :
3580390
Title :
Two-circle task scheduling algorithm based on MapReduce in cloud computing
Author :
Zhao Li-yan ; Wei Yan-na ; Zhang Yun-feng ; He Zhi-xue
Author_Institution :
Dept. of Comput. Sci. & Eng., North China Inst. of Aerosp. Eng., Langfang, China
fYear :
2014
Firstpage :
397
Lastpage :
400
Abstract :
The article mainly researches task scheduling algorithm based on MapReduce in cloud computing, presents a Two-circle task scheduling algorithm based on MapReduce, uses Weighted Round Robin in the first circle, and every task was executed in turn withen the cycle, assign more time slice on some tasks that can complete for more time, according to weighted value; Tasks execute based on knapsack theory in the second circle, namely perform more tasks with fixed times, short task, local task and task can be easy to implement will execute with priority, if there is no such task, we select task that time-value ratio is high to execute. So we can improve the efficiency of the original scheduling algorithm, taking into account the fairness of job execution, improve response time for short jobs, local jobs and job that is easy to implement.
Keywords :
cloud computing; data handling; knapsack problems; parallel processing; scheduling; MapReduce; cloud computing; job execution; knapsack theory; two-circle task scheduling algorithm; weighted round robin; Algorithm design and analysis; Cloud computing; Round robin; Scheduling; Time factors; MapReduce; cloud computing; knapsack algorithm; scheduling algorithmt;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology and Artificial Intelligence Conference (ITAIC), 2014 IEEE 7th Joint International
Print_ISBN :
978-1-4799-4420-0
Type :
conf
DOI :
10.1109/ITAIC.2014.7065078
Filename :
7065078
Link To Document :
بازگشت