DocumentCode :
3057845
Title :
QoS-constrained List Scheduling Heuristics for Parallel Applications on Grids
Author :
Baraglia, R. ; Ferrini, R. ; Tonellotto, N. ; Ricci, L. ; Yahyapour, R.
Author_Institution :
Italian Nat. Res. Council, Pisa
fYear :
2008
fDate :
13-15 Feb. 2008
Firstpage :
379
Lastpage :
383
Abstract :
This paper presents QLSE (QoS-constrained list scheduling heuristics), a quality of service-based launch time scheduling algorithm for wide area grids. QLSE considers applications described by a task interaction graph (TIG) whose nodes and edges are labeled according to the Quality of Service requirements of the application. The high values obtained in the performance evaluation for both the tasks communication and computation throughput demonstrates the applicability of the proposed approach.
Keywords :
graph theory; grid computing; parallel processing; quality of service; scheduling; QoS-constrained list scheduling heuristics; launch time scheduling algorithm; parallel applications; quality of service; task interaction graph; wide area grids; Application software; Bandwidth; Councils; Information science; Network topology; Peer to peer computing; Processor scheduling; Quality of service; Scheduling algorithm; Throughput; Grid computing; TIG; scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel, Distributed and Network-Based Processing, 2008. PDP 2008. 16th Euromicro Conference on
Conference_Location :
Toulouse
ISSN :
1066-6192
Print_ISBN :
978-0-7695-3089-5
Type :
conf
DOI :
10.1109/PDP.2008.68
Filename :
4457147
Link To Document :
بازگشت