Chinese Journal of Computers   Full Text
Title	Dynamic Level Scheduling Based on Trust Model in Grid Computing
Authors	YUAN Lu-Lai ZENG Guo-Sun JIANG Li-Li JIANG Chang-Jun
Address	(Department of Computer Science and Technology, Tongji University, Shanghai 201804)
Year	2006
Issue	No.7(1217—1224)
Abstract &   Background	Abstract The uncertainty of Grid users, resources and services may play a negative affect on the execution of Grid tasks, which makes it difficult to design a scheduling algorithm to minimize execution time and cheat probability of Grid tasks. Referring to the social trust relationship, the authors introduce a trust model that is based on the uncertainty reasoning theory(D-S theory).In addition, by combining the trust model and Dynamic Level Scheduling(DLS) algorithm, the authors propose a novel scheduling algorithm that is called Trustworthy and Dynamic Level Scheduling(TDLS). The algorithm takes the Grid nodes’ trust degree into account when calculating the scheduling-level of task-node pairs. Simulations prove that the algorithm can efficiently satisfy the QoS requirement in trust, with costing a few more time. keywords Grid computing; trustworthy scheduling; trust model; uncertainty reasoning; DLS algorithm background This work is supported by the National Natural Science Foundation of China(No.60173026), the Chinese Ministry of Education Key project (No.105071), and the SEC E-Institute: Shanghai High Institutions Grid (No.200301-1). An important object of these projects is to design matching and scheduling algorithms, which can satisfy the various QoS requirements, such as time, cost, trustworthiness and dependability. With lacking of enforceable agreements or global uniform laws for Grid, some untrustworthy users might cheat the others for their own benefits, without any penalty or punishment. One must resolve the trust problem is must resolved when scheduling tasks on other Grid nodes. So scheduling algorithms in Grid environment should take the Grid nodes’ trust degree into account when calculating the scheduling-level of task-node pairs. Aiming to minimize cheat probability and scheduling- length of Grid tasks, this paper first introduces a trust model with the uncertainty reasoning theory(D-S theory), and then propose a Trustworthy and Dynamic Level Scheduling algorithm based on the trust model.