Best resource node selection using rough sets theory

In Grid computing, the problem of selecting resources to specific jobs can be very complex, and may require co-allocation of different resources such as specific amount of CPU hours, system memory and network bandwidth for data transfer, etc. Because of the lack of centralized control and the dynamic nature of resource availability, any successful selection mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have a selection mechanism that does not rely on the availability of coherent global information. This paper considers selection method in grid environment using rough set theory, which could select the best node in grid environment. The proposed method is designed to achieve the following goals: handling large number of incoming requests simultaneously; assigning each service efficiently to all the incoming requests; selecting the appropriate services for the incoming requests within a reasonable time. Random data is used to test the validity of proposed method in this paper. The result showed that this method can provide the suitable probability of the best node selection.

[1]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[2]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[3]  De-Ren Chen,et al.  Intelligent agent-based scheduling mechanism for grid service , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[4]  Urszula Wybraniec-Skardowska,et al.  Extensions and Intentions in the Ruogh Set Theory , 1998, Inf. Sci..

[5]  César A. F. De Rose,et al.  VRM: a failure-aware grid resource management system , 2005, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05).

[6]  Xingfu Wu,et al.  Performance Prediction-based versus Load-based Site Selection: Quantifying the Difference , 2005, ISCA PDCS.

[7]  Rajkumar Buyya,et al.  A Deadline and Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids , 2002, ArXiv.

[8]  Hanan Lutfiyya,et al.  Context-aware service selection based on dynamic and static service attributes , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[9]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[10]  Chuang Liu,et al.  Design and evaluation of a resource selection framework for Grid applications , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[11]  Vincenzo Loia,et al.  Improving Fuzzy Service Matchmaking through Concept Matching Discovery , 2007, 2007 IEEE International Fuzzy Systems Conference.

[12]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[13]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[14]  Francisco Vilar Brasileiro,et al.  Faults in grids: why are they so bad and what can be done about it? , 2003, Proceedings. First Latin American Web Congress.

[15]  César A. F. De Rose,et al.  VRM: A Failure-Aware Grid Resource Management System , 2005, SBAC-PAD.

[16]  Friederike Klan.  Context-aware service discovery, selection and usage , 2006, Grundlagen von Datenbanken.