TY - GEN
T1 - QoS oriented resource reservation in shared environments
AU - Wu, Ming
AU - Sun, Xian He
AU - Chen, Yong
PY - 2006
Y1 - 2006
N2 - Resource sharing across different computers and organizations makes it possible to support diverse, dynamic changing resource requirements of distributed applications. Reservation mechanisms have been used to reserve resources for external applications through service level agreements between local resource organizations and external applications. However, the effects of resource reservation on local applications, and therefore the trustfulness of the successful fulfillment of the service agreement, have been ignored. In this paper, we investigate the effect of resource reservation on external applications as well as local jobs, and design efficient task scheduling algorithms considering the tolerance of local jobs to resource reservation. Extensive simulations and implementation experiments have been carried out to confirm our analysis results. Experimental results show that the relative slowdown metric and the failure-minimization scheduling algorithms proposed in this study are practically effective and have a real potential.
AB - Resource sharing across different computers and organizations makes it possible to support diverse, dynamic changing resource requirements of distributed applications. Reservation mechanisms have been used to reserve resources for external applications through service level agreements between local resource organizations and external applications. However, the effects of resource reservation on local applications, and therefore the trustfulness of the successful fulfillment of the service agreement, have been ignored. In this paper, we investigate the effect of resource reservation on external applications as well as local jobs, and design efficient task scheduling algorithms considering the tolerance of local jobs to resource reservation. Extensive simulations and implementation experiments have been carried out to confirm our analysis results. Experimental results show that the relative slowdown metric and the failure-minimization scheduling algorithms proposed in this study are practically effective and have a real potential.
UR - http://www.scopus.com/inward/record.url?scp=33751076286&partnerID=8YFLogxK
U2 - 10.1109/CCGRID.2006.82
DO - 10.1109/CCGRID.2006.82
M3 - Conference contribution
AN - SCOPUS:33751076286
SN - 0769525857
SN - 9780769525853
T3 - Sixth IEEE International Symposium on Cluster Computing and the Grid, 2006. CCGRID 06
SP - 601
EP - 608
BT - Sixth IEEE International Symposium on Cluster Computing and the Grid
Y2 - 16 May 2006 through 19 May 2006
ER -