Complexity analysis of a matchmaker based on hidden Markov model for decentralised grid scheduling
by H. Bolívar; M. Martínez; R. González; O. Sanjuán
International Journal of Grid and Utility Computing (IJGUC), Vol. 5, No. 3, 2014

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.

Online publication date: Wed, 29-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email