A Selective Algorithm Based on Multiple QoS Constraints for Grid Task Scheduling

Author

Zheng, Guping ; Liu, Yang

Author_Institution

Sch. of Comput. Sci. & Eng., North China Electr. Power Univ., Baoding

fYear

2008

fDate

1-3 Nov. 2008

Firstpage

239

Lastpage

242

Abstract

In computational grid environments, QoS guided scheduling problem, especially when the task has multiple QoS demands, is complex and challenging. AQoS guided scheduling heuristic algorithm for a set of independent tasks has been presented. In this paper we introduce a new selective algorithm based on multiple QoS constraints for grid task scheduling. The experiments show that the algorithm not only considers the multiple QoS constraints, but also has better performance and load balance than the QoS guided Min-Min algorithm.

Keywords

grid computing; quality of service; scheduling; QoS guided scheduling problem; computational grid environment; grid task scheduling; multiple QoS constraints; multiple QoS demands; scheduling heuristic algorithm; selective algorithm; Computer science; Grid computing; Heuristic algorithms; Intelligent networks; Load management; Power engineering and energy; Power systems; Processor scheduling; Quality of service; Scheduling algorithm; Grid computing; QoS; task scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Networks and Intelligent Systems, 2008. ICINIS '08. First International Conference on

Conference_Location

Wuhan

Print_ISBN

978-0-7695-3391-9

Electronic_ISBN

978-0-7695-3391-9

Type

conf

DOI

10.1109/ICINIS.2008.107

Filename

4683210