DocumentCode :
2344070
Title :
A Data-Intensive Workflow Scheduling Algorithm for Grid Computing
Author :
Xu, Meng ; Cui, Lizhen ; Wang, Haiyang ; Bi, Yanbing ; Bian, Ji
Author_Institution :
Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan, China
fYear :
2009
fDate :
21-22 Aug. 2009
Firstpage :
110
Lastpage :
115
Abstract :
The data-intensive workflow in scientific and enterprise grids has gained popularity in recent times. Data-intensive workflow needs to access, process and transfer large datasets that may each be replicated on different data hosts. Because of the large data sets, the execution time is bounded by the cost of data transfer. Minimizing the time of transferring these datasets to the computational resources where the tasks of workflow are executed requires that appropriate computational and data resources be selected. In this paper, we introduce an algorithm MDTT to select the resource set which the task should be mapped. Our experiments show that our algorithm is able to minimize the total makespan of data-intensive workflow and the time of data transferring.
Keywords :
data handling; grid computing; scheduling; computational resources; data resources; data transfer cost; data-intensive workflow scheduling algorithm; grid computing; Aggregates; Algorithm design and analysis; Bismuth; Computer science; Costs; Data analysis; Delay; Grid computing; Processor scheduling; Scheduling algorithm; Data-intensive; Grid computing; Scheduling; Workflow;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
ChinaGrid Annual Conference, 2009. ChinaGrid '09. Fourth
Conference_Location :
Yantai, Shandong
Print_ISBN :
978-0-7695-3818-1
Type :
conf
DOI :
10.1109/ChinaGrid.2009.30
Filename :
5328209
Link To Document :
بازگشت