中国邮电高校学报(英文) ›› 2009, Vol. 16 ›› Issue (2): 108-113.doi: 10.1016/S1005-8885(08)60213-7

• Distributed Network Computing • 上一篇    下一篇

Relaxed resource advance reservation policy in grid computing

肖鹏,胡志刚   

  1. School of Information Science and Engineering, Central South University, Changsha 410083, China
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-30
  • 通讯作者: 肖鹏

Relaxed resource advance reservation policy in grid computing

XIAO Peng, HU Zhi-gang   

  1. School of Information Science and Engineering, Central South University, Changsha 410083, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-04-30
  • Contact: XIAO Peng

摘要:

The advance reservation technique has been widely applied in many grid systems to provide end-to-end quality of service (QoS). However, it will result in low resource utilization rate and high rejection rate when the reservation rate is high. To mitigate these negative effects brought about by advance reservation, a relaxed advance reservation policy is proposed, which allows accepting new reservation requests that overlap the existing reservations under certain conditions. Both the benefits and the risks of the proposed policy are presented theoretically. The experimental results show that the policy can achieve a higher resource utilization rate and lower rejection rate compared to the conventional reservation policy and backfilling technique. In addition, the policy shows better adaptation when the grid systems are in the presence of a high reservation rate.

关键词:

grid;computing,;advance;reservation,;reservation;violation,;computing;economy

Abstract:

The advance reservation technique has been widely applied in many grid systems to provide end-to-end quality of service (QoS). However, it will result in low resource utilization rate and high rejection rate when the reservation rate is high. To mitigate these negative effects brought about by advance reservation, a relaxed advance reservation policy is proposed, which allows accepting new reservation requests that overlap the existing reservations under certain conditions. Both the benefits and the risks of the proposed policy are presented theoretically. The experimental results show that the policy can achieve a higher resource utilization rate and lower rejection rate compared to the conventional reservation policy and backfilling technique. In addition, the policy shows better adaptation when the grid systems are in the presence of a high reservation rate.

Key words:

grid computing;advance reservation;reservation violation;computing economy