TY - GEN
T1 - A resource minimizing scheduling algorithm with ensuring the deadline and reliability in heterogeneous systems
AU - Zhao, Laiping
AU - Ren, Yizhi
AU - Sakurai, Kouichi
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - The distributed system made the large-scale scientific computing possible in a cost effective way. And the hardware resources in such systems are also getting much cheaper than years before. However, the problem of executing the job using minimum resources is still reasonable and important, especially for the cloud environment, who has to save energy and control cost. Unfortunately, only a few existing scheduling algorithms have taken into account the resource usage issue. In this study, with considering the realistic network topology and communication model, we firstly propose the Deadline, Reliability, Resources-aware (DRR) scheduling algorithm. The theory analysis fully demonstrate that, the output schedule of our algorithm can satisfy the user's requirement on reliability and deadline. Through the experiments, with setting the deadline less than the makespan of the MaxRe algorithm's output schedule, we find that our algorithm can complete the job under this deadline. Besides, our algorithm can save almost 50% computation resources and 70% communication resources than FTSA(bl) and FTSA(tl+bl) [3] algorithms.
AB - The distributed system made the large-scale scientific computing possible in a cost effective way. And the hardware resources in such systems are also getting much cheaper than years before. However, the problem of executing the job using minimum resources is still reasonable and important, especially for the cloud environment, who has to save energy and control cost. Unfortunately, only a few existing scheduling algorithms have taken into account the resource usage issue. In this study, with considering the realistic network topology and communication model, we firstly propose the Deadline, Reliability, Resources-aware (DRR) scheduling algorithm. The theory analysis fully demonstrate that, the output schedule of our algorithm can satisfy the user's requirement on reliability and deadline. Through the experiments, with setting the deadline less than the makespan of the MaxRe algorithm's output schedule, we find that our algorithm can complete the job under this deadline. Besides, our algorithm can save almost 50% computation resources and 70% communication resources than FTSA(bl) and FTSA(tl+bl) [3] algorithms.
UR - http://www.scopus.com/inward/record.url?scp=79957691029&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79957691029&partnerID=8YFLogxK
U2 - 10.1109/AINA.2011.87
DO - 10.1109/AINA.2011.87
M3 - Conference contribution
AN - SCOPUS:79957691029
SN - 9780769543376
T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA
SP - 275
EP - 282
BT - Proceedings - 25th IEEE International Conference on Advanced Information Networking and Applications, AINA 2011
T2 - 25th IEEE International Conference on Advanced Information Networking and Applications, AINA 2011
Y2 - 22 March 2011 through 25 March 2011
ER -