Reduct algorithm based execution times prediction in knowledge discovery cloud computing environment

Cloud environment is a complex system which includes the matching between computation resources and data resources. Efficient predicting services execution time is a key component of successful tasks scheduling and resource allocation in cloud computing environment. In this paper, we propose a framework for supporting knowledge discovery application running in cloud environment as well as a holistic approach to predict the application execution times. We use rough sets theory to determine a reduct and then compute the execution time prediction. The spirit of the algorithm, which we proposed comes from the number of attributes within a given discernibility matrix. We also propose to join dynamic data related to the performances of various knowledge discovery services in the cloud computing environment for supporting the prediction. This information can be joined as additional metadata stored in cloud environment. Experimental result verifies that the proposed algorithm in this paper supply a general solution for the problem of web service execution time prediction in cloud environment.

[1]  Allen B. Downey Predicting queue times on space-sharing parallel computers , 1997, Proceedings 11th International Parallel Processing Symposium.

[2]  M. Phil,et al.  PRIVACY-PRESERVING PUBLIC AUDITING FOR DATA STORAGE SECURITY IN CLOUD COMPUTING , 2015 .

[3]  Andrzej Skowron,et al.  Rough-Fuzzy Hybridization: A New Trend in Decision Making , 1999 .

[4]  Warren Smith,et al.  Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance , 1999, JSSPP.

[5]  Richard Gibbons,et al.  A Historical Application Profiler for Use by Parallel Schedulers , 1997, JSSPP.

[6]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[7]  Cong Wang,et al.  Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Azween B. Abdullah,et al.  A new grid resource discovery framework , 2011, Int. Arab J. Inf. Technol..

[9]  Jemal H. Abawajy,et al.  A rough set approach for selecting clustering attribute , 2010, Knowl. Based Syst..

[10]  Chris Rose,et al.  A Break in the Clouds: Towards a Cloud Definition , 2011 .

[11]  Luis Rodero-Merino,et al.  A break in the clouds: towards a cloud definition , 2008, CCRV.

[12]  Warren Smith,et al.  Predicting Application Run Times Using Historical Information , 1998, JSSPP.

[13]  Rajkumar Buyya,et al.  High-Performance Cloud Computing: A View of Scientific Applications , 2009, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks.

[14]  Andrzej Skowron,et al.  Rough Sets: A Tutorial , 1998 .

[15]  Richard Wolski,et al.  The Eucalyptus Open-Source Cloud-Computing System , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[16]  Raouf Boutaba,et al.  Cloud computing: state-of-the-art and research challenges , 2010, Journal of Internet Services and Applications.

[17]  Xiangyang Wang,et al.  Feature selection based on rough sets and particle swarm optimization , 2007, Pattern Recognit. Lett..