Complexity analysis of a matchmaker based on hidden Markov model for decentralised grid scheduling

The design of scheduling algorithms for a heterogeneous computing system interconnected with an arbitrary communication network is one of the main concerns in distributed systems research, due to the heterogeneous nature of resource, computing capacity, memory, devices, internet and institutional policies. Different models have been proposed for the scheduler, which contemplate point-to-point communication to allow the direct exchange of information and provide more flexibility to the planning within the open systems. This balances the load of the system, improves interoperability between the components, the management of resources, performance, reliability and a high degree of scalability. However, related works assumed the lack of control of the resource by scheduler. We propose the analysis of theoretical and experimental complexity of an algorithm based on hidden Markov models because it facilitates the prediction of availability of the grid resources and can evolve over time.

[1]  K. Somasundaram,et al.  Efficient Resource Scheduler for Parallel Implementation of MSA Algorithm on Computational Grid , 2010, 2010 International Conference on Recent Trends in Information, Telecommunication and Computing.

[2]  Sujata Banerjee,et al.  A large scale fault-tolerant grid information service , 2006, MCG '06.

[3]  Sunilkumar S. Manvi,et al.  An agent-based resource allocation model for grid computing , 2005, 2005 IEEE International Conference on Services Computing (SCC'05) Vol-1.

[4]  Pengcheng Zhang,et al.  A novel multi-agent reinforcement learning approach for job scheduling in Grid computing , 2011, Future Gener. Comput. Syst..

[5]  Eduardo Huedo,et al.  Dynamic Objective and Advance Scheduling in Federated Grids , 2008, OTM Conferences.

[6]  Pierre Baldi,et al.  Bioinformatics - the machine learning approach (2. ed.) , 2000 .

[7]  Salvatore Venticinque,et al.  Integration of Mobile Agents Technology and Globus for Assisted Design and Automated Development of Grid Services , 2009, 2009 International Conference on Computational Science and Engineering.

[8]  Zhiwei Xu,et al.  Incentive-Based Scheduling for Market-Like Computational Grids , 2008, IEEE Transactions on Parallel and Distributed Systems.

[9]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[10]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[11]  Douglas G. Down,et al.  Decentralized Load Balancing for Heterogeneous Grids , 2009, 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns.

[12]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[13]  P Sapra,et al.  Multi-Agent Systems for Adaptive and Efficient Job Scheduling Service in Grids , 2010 .

[14]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[15]  Salim Hariri,et al.  Application of autonomic agents for global information grid management and security , 2007, SCSC.

[16]  Fan Zhang,et al.  An Agent Federations Based Infrastructure for Grid Monitoring and Discovery , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[17]  Ruay-Shiung Chang,et al.  A new mechanism for resource monitoring in Grid computing , 2009, Future Gener. Comput. Syst..

[18]  Fatos Xhafa,et al.  Computational models and heuristic methods for Grid scheduling problems , 2010, Future Gener. Comput. Syst..

[19]  Florin Pop.  Communication Model for Decentralized Meta-Scheduler in Grid Environments , 2008, 2008 International Conference on Complex, Intelligent and Software Intensive Systems.

[20]  Minjie Zhang,et al.  An agent-based peer-to-peer grid computing architecture: convergence of grid and peer-to-peer computing , 2006, ACSW.

[21]  Chris Phillips,et al.  Job-scheduling via resource availability prediction for volunteer computational grids , 2011, Int. J. Grid Util. Comput..

[22]  Ousmane Thiare,et al.  Performance comparison of hierarchical checkpoint protocols grid computing , 2012, Int. J. Interact. Multim. Artif. Intell..

[23]  Minjie Zhang,et al.  Agent-Based Grid Computing , 2008, Computational Intelligence: A Compendium.

[24]  Graham R. Nudd,et al.  Performance evaluation of an agent-based resource management infrastructure for grid computing , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[25]  Subhash Saini,et al.  Agent-based grid load balancing using performance-driven task scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[26]  Wico Mulder,et al.  Grid management support by means of collaborative learning agents , 2009, GMAC '09.