QoS Matching Offset Algorithm Based on Trust-Driven for Computing Grid

Author

Li Ran ; Yu Jiong

Author_Institution

Sch. of Inf. Sci. & Eng., Xinjiang Univ., Urumqi

Volume

3

fYear

2008

fDate

12-14 Dec. 2008

Firstpage

170

Lastpage

173

Abstract

In this paper, by introducing the conception of QoS matching offset between tasks and resources in grid scheduling tasks are able to be allocated on demand. Meanwhile, we take into consideration the utility of trust QoS between tasks and resources in the scheduling. Therefore, job schedule algorithm TD_QMO (trust-driven QoS matching offset) based on trust driven is presented for computing grid. The simulation results show that the algorithmpsilas performance is better than TD trust-relation, TD_Min-min in the aspects of effective resource, trust utility, load balance.

Keywords

grid computing; quality of service; scheduling; security of data; TD trust-relation; TD_Min-min; computing grid; grid scheduling; job schedule algorithm; trust-driven QoS matching offset algorithm; Computer science; Grid computing; Information science; Processor scheduling; Radio access networks; Resource management; Scheduling algorithm; Security; Software algorithms; Software engineering; QoS matching offset; grid computing; job schedule; trust model; trust-driven;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Software Engineering, 2008 International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-0-7695-3336-0

Type

conf

DOI

10.1109/CSSE.2008.564

Filename

4722315