A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids
A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids
复制标题
数据网格上电子科学应用的期限和预算约束调度算法
DOI：
10.1007/11564621_7
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
R. Buyya
中科院分区：
文献类型：
--
作者：
S. Venugopal;R. Buyya
在本文中，我们提出了一个算法调度分布式数据密集型的任务袋应用程序的数据网格，有成本与请求，传输和处理数据集。该算法考虑了由于作业需要来自多个数据源的多个数据集而导致的选择爆炸。该算法建立一个资源集的作业，最大限度地减少成本或时间取决于用户的喜好和最后期限和预算约束。我们评估的数据网格测试平台上的算法，并提出的结果。
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.