Title :
Reputation-Aware Scheduling for Storage Systems in Data Grids
Author :
Liu, Wei ; Du, Wei
Abstract :
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 .
Keywords :
grid computing; scheduling; security of data; virtual storage; data grids; data-intensive job scheduling; degree of reputation sufficiency; dynamic scheduling strategy; performance metric; reputation service; reputation-aware scheduling; storage systems; Application software; Computer science; Educational institutions; Feedback; Grid computing; High performance computing; Middleware; Processor scheduling; Quality of service; Scheduling algorithm;
Conference_Titel :
Frontier of Computer Science and Technology, 2009. FCST '09. Fourth International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-0-7695-3932-4
Electronic_ISBN :
978-1-4244-5467-9
DOI :
10.1109/FCST.2009.112