The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2006)
Bialystok, Poland
Sept. 13, 2006 to Sept. 17, 2006
ISBN: 0-7695-2554-7
pp: 257-262
V. Fiolet , Universite des Sciences et Technologies de Lille (USTL), France
E. Laskowski , Polish Academy of Sciences, Poland
R. Olejnik , Universite des Sciences et Technologies de Lille (USTL), France
L. Masko , Polish Academy of Sciences, Poland
B. Toursel , Universite des Sciences et Technologies de Lille (USTL), France
M. Tudruj , Polish Academy of Sciences, Poland
The exponential computational cost involved in traditional data mining methods enforces search for less complex new algorithms. Especially, data mining on Grid is a challenge due to the lack of shared memory in Grid computing, which puts special attention to communication optimization. The aim of the DisDaMin project (Distributed Data Mining), descibed in the paper, is solving data mining problems by using new distributed algorithms intented for execution in Grid environments. The DisDaMin implements intelligent fragmentation of data by clustering methods and asynchronous collaborative processing adjusted to Grid environments. The DG-ADAJ environment provides adaptive control of distributed applications written in Java for Desktop Grid. It constitutes a component-based middleware, which allows for optimized distribution of applications on clusters of Java Virtual Machines, monitoring of application execution and dynamic on-line balancing of processing and communication. The DG-ADAJ system provides a middleware platform for Desktop Grid that could be used as a deployment base for DisDaMin algorithms. In this paper, we propose static object placement optimization algorithms for fragmentation of data in the DisDaMin project. The algorithms use DG-ADAJ?s object clustering methods to provide optimized local pro

B. Toursel, R. Olejnik, L. Masko, V. Fiolet, E. Laskowski and M. Tudruj, "Optimizing Distributed Data Mining Applications Based on Object Clustering Methods," International Symposium on Parallel Computing in Electrical Engineering(PARELEC), Bialystok, 2006, pp. 257-262.
88 ms
(Ver 3.3 (11022016))