Data Sharing Pattern Aware Scheduling on Grids

These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, data-mining and image processing are some typical areas of data-intensive applications. Such applications tend to be deployed on grids that provide powerful processing capabilities at reasonable cost. One fundamental scheduling issue, that arises when exploiting grids with these types of applications, is the minimization of data transfer. Therefore, the use of an efficient scheduling scheme that takes into account data transfers is rather essential in order to achieve both a shorter application completion time and efficient system utilization. In this paper, a novel scheduling algorithm, called the Shared Input data based Listing (SIL) algorithm for dataintensive bag-of-tasks (DBoT) applications in grid environments is proposed. The algorithm uses a set of task lists that are constructed taking the data sharing...

• Type: Conference
• Year: 2006
• Where: ICPP
• Authors: Young Choon Lee, Albert Y. Zomaya
• Keywords: Completion Time, Dbot Application, Distributed And Parallel Computing, Efficient Scheduling Scheme, ICPP 2006