Speculative Scheduling of Parameter Sweep Applications Using Job Behavior Descriptions

Speculative Scheduling of Parameter Sweep Applications Using Job Behavior Descriptions

Attila Ulbert, László Csaba Lorincz, Tamás Kozsik, Zoltán Horváth
Copyright: © 2009 |Pages: 17
DOI: 10.4018/jghpc.2009010103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The execution of data intensive Grid applications still raises several questions regarding job scheduling, data migration and replication. This article presents new scheduling algorithms using complex job behavior descriptions that allow estimating job completion times more precisely thus improving scheduling decisions. Three approaches of using complex, re-fined job descriptions are discussed: a) single job description, b) multiple job descriptions, c) multiple job descriptions with mutation. The proposed Grid middleware components (1) monitor the execution of jobs and gather resource access information, (2) analyze the compiled information and generate a description of the behavior of the job, (3) refine the already existing job description, and (4) use the refined behavior description to schedule the submitted jobs.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024)
Volume 15: 2 Issues (2023)
Volume 14: 6 Issues (2022): 1 Released, 5 Forthcoming
Volume 13: 4 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing