A Heuristic Data Distribution Scheme for data mining applications on grid environments

Effective data distribution techniques can significantly reduce the total execution time of a program on grid computing environments, especially for data mining applications. In this paper, we describe a linear programming formulation for the data distribution problem on grids. Furthermore, a heuristic method, named HDDS (heuristic data distribution scheme), is proposed to solve this problem. We implement the parallel association rule mining method and conduct the experimentations on our grid testbed. Experimental results showed that data mining programs using our HDDS to distribute data could execute more efficiently than traditional schemes could.