Paper Info
Title
A deadline and budget constrained scheduling algorithm for escience applications on data grids
Abstract
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing datasets. The algorithm takes into account the explosion of choices that result due to a job requiring multiple datasets from multiple data sources. The algorithm builds a resource set for a job that minimizes the cost or time depending on the user’s preferences and deadline and budget constraints. We evaluate the algorithm on a Data Grid testbed and present the results.
Year
DOI
Venue
2005
10.1007/11564621_7
ICA3PP
Keywords
Field
DocType
data grid testbed,data grid,escience application,processing datasets,data intensive bag-of-task application,budget constraint,multiple datasets,multiple data source,data grids,scheduling algorithm
Data processing,Budget constraint,Computer science,Scheduling (computing),Data grid,Testbed,Real-time computing,Distributed algorithm,Earliest deadline first scheduling,Storage Resource Broker,Distributed computing
Conference
Volume
ISSN
ISBN
3719
0302-9743
3-540-29235-7
Citations 
PageRank 
References 
22
1.46
20
Authors
2
Name
Order
Citations
PageRank
SRIKUMAR VENUGOPAL14236294.23
Rajkumar Buyya2232081340.23