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

Authors: H. Bolívar; M. Martínez; R. González; O. Sanjuán

Addresses: Faculty of Engineering, Catholic University of Colombia, Bogotá, Colombia ' Faculty of Engineering, Catholic University of Colombia, Bogotá, Colombia ' College of Engineering and Architecture, Pontifical University of Salamanca, Salamanca, Spain ' Engineering Faculty, Carlos III University, Madrid, Spain

Abstract: 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.

Keywords: computational grids; grid scheduling; hidden Markov model; grid computing; complexity analysis; matchmaker; decentralised grid; grid resources; distributed systems.

DOI: 10.1504/IJGUC.2014.062927

International Journal of Grid and Utility Computing, 2014 Vol.5 No.3, pp.190 - 197

Received: 14 Feb 2013
Accepted: 30 Aug 2013

Published online: 25 Jun 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article