Using Frequent Workload Patterns in Resource Selection for Grid Jobs

Resource selection is an important issue of grid computing. If a grid job can stably gain enough CPU time from the same resources, not only the execution time of the job but also the frequency of resource reallocation is effectively minimized. However, most of the proposed methods are not effective enough to resolve the problem of resource selection in computational grids. The main reason is that these methods usually make use of current workload state or short-term prediction in available CPU time to be the basis of resource selection while most of grid jobs require a long execution time. To address this problem, we propose a novel algorithm of resource selection for computational grids in this paper. The basic concept of this algorithm is to discover the frequent workload patterns of resources, and then select resources for grid jobs according to the long-term prediction of resource availability by using frequent workload patterns.

[1]  Richard Wolski,et al.  Predicting the CPU availability of time‐shared Unix systems on the computational grid , 2004, Cluster Computing.

[2]  Johan Tordsson,et al.  Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions , 2008, Future Gener. Comput. Syst..

[3]  Jyh-Biau Chang,et al.  A multi-layer resource reconfiguration framework for grid computing , 2006, MCG '06.

[4]  Chao-Tung Yang,et al.  A Resource Broker for Computing Nodes Selection in Grid Computing Environments , 2004, GCC.

[5]  Ian T. Foster,et al.  Condor-G: A Computation Management Agent for Multi-Institutional Grids , 2004, Cluster Computing.

[6]  Sathish S. Vadhiyar,et al.  Self adaptivity in Grid computing , 2005, Concurr. Pract. Exp..

[7]  Hui He,et al.  Multisite resource selection and scheduling algorithm on computational grid , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[8]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[9]  Marty Humphrey,et al.  Toward Realizable Restricted Delegation in Computational Grids , 2001, HPCN Europe.

[10]  Ian T. Foster,et al.  Homeostatic and tendency-based CPU load predictions , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[11]  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.

[12]  Francine Berman,et al.  Application-Level Scheduling on Distributed Heterogeneous Networks , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[13]  Chao-Tung Yang,et al.  An Efficient Parallel Loop Self-scheduling on Grid Environments , 2004, NPC.

[14]  Richard Wolski,et al.  Dynamically forecasting network performance using the Network Weather Service , 1998, Cluster Computing.

[15]  Guangwen Yang,et al.  Load prediction using hybrid model for computational grid , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[16]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[17]  R. Wolski,et al.  Predicting the CPU availability of time‐shared Unix systems on the computational grid , 1999, Proceedings. The Eighth International Symposium on High Performance Distributed Computing (Cat. No.99TH8469).

[18]  Minglu Li,et al.  A Novel Agent-Based Load Balancing Algorithm for Grid Computing , 2004, GCC Workshops.

[19]  Ian T. Foster,et al.  Globus Toolkit Version 4: Software for Service-Oriented Systems , 2005, Journal of Computer Science and Technology.

[20]  Carl Kesselman,et al.  Monitoring the grid with the Globus Toolkit MDS4 , 2006 .