Knowledge discovery in databases: an attribute-oriented rough set approach
Knowledge discovery in databases: an attribute-oriented rough set approach
Data mining: practical machine learning tools and techniques with Java implementations
Data mining: practical machine learning tools and techniques with Java implementations
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Techniques for mapping tasks to machines in heterogeneous computing systems
Journal of Systems Architecture: the EUROMICRO Journal - Heterogeneous distributed and parallel architectures: hardware, software and design tools
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Towards Network-Aware Data Mining
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Predicting Application Run Times Using Historical Information
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Rough set based data mining tasks scheduling on knowledge grid
AWIC'05 Proceedings of the Third international conference on Advances in Web Intelligence
Rough set based computation times estimation on knowledge grid
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
A dynamic-balanced scheduler for genetic algorithms for grid computing
WSEAS Transactions on Computers
Hi-index | 0.00 |
In order to improve the performance of Data Mining applications, an effective method is task parallelization. The scheduler on Grid plays an important role to management subtasks so as to achieve high performance. We introduce an additional component that we call serializer, whose purpose is to decompose the tasks into a series of independent tasks according the directed acyclic graph (DAG), and send them to the scheduler queue as soon as they become executable with respect to the DAG dependencies. The experimental result demonstrates that the architecture has good performance.