Knowledge discovery in databases: an attribute-oriented rough set approach
Knowledge discovery in databases: an attribute-oriented rough set approach
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Data mining: practical machine learning tools and techniques with Java implementations
Data mining: practical machine learning tools and techniques with Java implementations
NILE: wide-area computing for high energy physics
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Predicting Queue Times on Space-Sharing Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Historical Application Profiler for Use by Parallel Schedulers
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Predicting Application Run Times Using Historical Information
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Scheduling High Performance Data Mining Tasks on a Data Grid Environment
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
The Cactus Code: A Problem Solving Environment for the Grid
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
| Hi-index | 0.00 |
In dynamic environment, the performance is restricted by various components, so we can not determine the contribution to performanc using traditional method. In this paper, we propose a novel method for predicting the performance in Grid Computing environment. We use the concept of Reduct in Rough Set theory and history record collected during a period of time to predict the applications runtime that the traditional methods can't obtain. We use the novel method in Data Ming Grid. The approach is based on frequencies of attributes appeared in discernibility matrix. The theoretical foundation of rough sets provides an intuitive solution to the problem of application run time estimation on Data Ming Grid. The results of the experiment show that the use of Rough Set theory can process uncertain problem in distributed and dynamic environment, and obtain better result than traditional methods.