By Topic

An efficient negotiation based algorithm for resources advanced reservation using hill climbing in grid computing system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Seiiedeh Yasaman Rashida ; Arak branch, Islamic Azad University, Iran ; Mohammad TeshnehLab ; Amir Masoud Rahmani

Ensuring quality of services and reducing the blocking probability is one of the important cases in the environment of grid computing. In this paper, we present a deadline aware algorithm to give solution to ensuring the end-to-end QoS and improvement of the efficiency of grid resources. Investigating requests as a group in the start of time slot and trying to accept the highest number of them. Totally can cause to increase the possibility of acceptance of requests and also increase efficiency of grid resources. Deadline aware algorithm reaches us to this goal. Simulations show that the deadline aware algorithm improves efficiency of advance reservation resources in both case. Possibility of acceptance of requests and optimizing resources in short time slot and also in rate of high entrance of requests in each time.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010