Paper Info
Title
Scheduling Workflow-based Parameter-Sweep Applications with Best-Intermediate-Result-First Heuristic
Abstract
Workflow-based parameter-sweep applications are an important class of parallel jobs on clusters and grid today. Conventional batch schedulers and parameter study tools are not effective for this type of application. Especially, their scheduling policies are usually designed to minimize the makespan of the whole parameter study. However, many parameter-sweep applications also have a primary objective to obtain the best or a few top-ranked results from a large parameter space. This paper describes a new heuristic for scheduling parameter-sweep workflows in order to minimize the turnaround time of the workflows that give the best results. The algorithm is based on dynamically adjusted priority according to intermediate data obtained at some stage in the workflow. The technique is applied on a high-throughput drug screening application. The experimental results show that our technique can significantly improve the correlation between the ranking of the final results and the order of completion of the workflows
Year
DOI
Venue
2006
10.1109/CLUSTR.2006.311871
Barcelona
Keywords
Field
DocType
processor scheduling,best-intermediate-result-first heuristic,high-throughput drug screening application,parallel jobs,workflow-based parameter-sweep scheduling
Fixed-priority pre-emptive scheduling,Job shop scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing
Conference
ISSN
ISBN
Citations 
1552-5244 E-ISBN : 1-4244-0328-6
1-4244-0328-6
2
PageRank 
References 
Authors
0.39
10
2
Name
Order
Citations
PageRank
Kunaporn Srimanotham120.39
Veera Muangsin220.39