A Distributed Iterative Algorithm for Optimal Scheduling in Grid Computing

Year, pages: 2007, 605 - 626

The paper studies a distributed iterative algorithm for optimal scheduling in grid computing. Grid user's requirements are formulated as dimensions in a quality of service problem expressed as a market game played by grid resource agents and grid task agents. User benefits resulting from taking decisions regarding each Quality of Service dimension are described by separate utility functions. The total system quality of service utility is defined as a linear combination of the discrete form utility functions. The paper presents distributed algorithms to iteratively optimize task agents and resource agents functioning as sub-problems of the grid resource QoS scheduling optimization. Such constructed resource scheduling algorithm finds a multiple quality of service solution optimal for grid users, which fulfils some specified user preferences. The proposed pricing based distributed iterative algorithm has been evaluated by studying the effect of QoS factors on benefits of grid user utility, revenue of grid resource provider and execution success ratio.

Li, C., Li, L. 2007. A Distributed Iterative Algorithm for Optimal Scheduling in Grid Computing. In Computing and Informatics, vol. 26, no.6, pp. 605-626. 1335-9150.

Li, C., Li, L. (2007). A Distributed Iterative Algorithm for Optimal Scheduling in Grid Computing. Computing and Informatics, 26(6), 605-626. 1335-9150.