TY - GEN
T1 - A hierarchical scheduling strategy for the composition services architecture based on cloud computing
AU - Lee, Kuan Rong
AU - Fu, Meng Hsuan
AU - Kuo, Yau Hwang
PY - 2011/9/1
Y1 - 2011/9/1
N2 - This paper addresses the problem of composition service scheduling and resource allocation in cloud. In the development of cloud computing with data-intensive and compute-intensive features, many applications are based on Map/Reduce model to enhance the performance. A hierarchical scheduling scheme strategy, i.e., PPA2-level scheduler, is proposed in this paper for the composition services architecture to achieve planning of composition service scheduling with Map/Reduce model. While executing PPA2-level scheduler, it decomposes the total progress into three steps, i.e., preprocessing, pooling and allocating. It decides the job priority according to both service-level and task-level in the resource side. And the resources are allocated by taking the data locality and total job completion rate into account on the basis of cloud framework. In the numerical evaluation, it uses a Markov model to generate various scenarios of client requested composition services. Then it evaluates the strategy by applying the scheduling strategy mentioned above to compare with the default first-in-first-out scheduling (FIFO) of Hadoop. In different distribution of composition services, the proposed strategy also performs well, especially in I/O-Bound services. It achieves better performance (about 45 %) and efficiently decreases the probability of disk spill.
AB - This paper addresses the problem of composition service scheduling and resource allocation in cloud. In the development of cloud computing with data-intensive and compute-intensive features, many applications are based on Map/Reduce model to enhance the performance. A hierarchical scheduling scheme strategy, i.e., PPA2-level scheduler, is proposed in this paper for the composition services architecture to achieve planning of composition service scheduling with Map/Reduce model. While executing PPA2-level scheduler, it decomposes the total progress into three steps, i.e., preprocessing, pooling and allocating. It decides the job priority according to both service-level and task-level in the resource side. And the resources are allocated by taking the data locality and total job completion rate into account on the basis of cloud framework. In the numerical evaluation, it uses a Markov model to generate various scenarios of client requested composition services. Then it evaluates the strategy by applying the scheduling strategy mentioned above to compare with the default first-in-first-out scheduling (FIFO) of Hadoop. In different distribution of composition services, the proposed strategy also performs well, especially in I/O-Bound services. It achieves better performance (about 45 %) and efficiently decreases the probability of disk spill.
UR - http://www.scopus.com/inward/record.url?scp=80052119153&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052119153&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:80052119153
SN - 9788988678381
T3 - Proceedings - 2nd International Conference on Next Generation Information Technology, ICNIT 2011
SP - 163
EP - 169
BT - Proceedings - 2nd International Conference on Next Generation Information Technology, ICNIT 2011
T2 - 2nd International Conference on Next Generation Information Technology, ICNIT 2011
Y2 - 21 June 2011 through 23 June 2011
ER -