DocumentCode :
2607196
Title :
Grid workflow recovery as Dynamic constraint satisfaction problem
Author :
Dragiev, Stanimir ; Schneider, Joerg
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Tech. Univ. Berlin, Berlin, Germany
fYear :
2010
fDate :
5-7 Dec. 2010
Firstpage :
74
Lastpage :
79
Abstract :
With service level agreements (SLAs) the Grid broker guarantees to finish the Grid jobs by a given deadline. There are a number of approaches, to plan reservations to fulfil these deadline requirements and to handle currently running jobs in the case of a resource failure. However, there is a lack of strategies to handle the already planned but not yet started jobs. These jobs will be most likely also affected by the resource failure and can be remapped to other resources well in advance. Complex Grid jobs (Grid workflows) consisting of multiple sub-jobs introduce a higher complexity to determine a remapping saving as much Grid jobs as possible. In this paper a recovery scheme for Grid workflows using a dynamic constraint solver is presented and the gain in the number of saved Grid jobs is evaluated using extensive simulations.
Keywords :
constraint theory; grid computing; workflow management software; dynamic constraint satisfaction problem; grid jobs; grid workflow recovery; service level agreements; Complexity theory; Computational modeling; Indexes; Load modeling; Optimal scheduling; Quality of service; Schedules;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Open Systems (ICOS), 2010 IEEE Conference on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4244-9193-3
Type :
conf
DOI :
10.1109/ICOS.2010.5720067
Filename :
5720067
Link To Document :
بازگشت