By Topic

Reputation-Aware Scheduling for Storage Systems in Data Grids

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
$31 $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

2 Author(s)

Data grids provide such data-intensive applications with a large virtual storage framework with unlimited power. However, conventional scheduling algorithms for data grids are unable to meet the reputation service requirements of data-intensive applications. In this paper we address the problem of scheduling data-intensive jobs on data grids subject to reputation service constraints. Using the reputation-aware technique, the dynamic scheduling strategy is proposed to improve the capability of predicting the reliability and credibility for data-intensive applications. To incorporate reputation service into job scheduling, we introduce a new performance metric, degree of reputation sufficiency, to quantitatively measure quality of reputation service provided by data grids. Experimental results based on a simulated grid show that the proposed scheduling strategy significantly is capable of significantly satisfying the reputation service requirements and guaranteeing the desired response times .

Published in:

Frontier of Computer Science and Technology, 2009. FCST '09. Fourth International Conference on

Date of Conference:

17-19 Dec. 2009