Complexity analysis of a matchmaker based on hidden Markov model for decentralised grid scheduling. (1st January 2014)

• Record Type: Journal Article
• Authors: Bolívar, H.; Martínez, M.; González, R.; Sanjuán, O.
• Is Part Of: International journal of grid and utility computing. Volume 5:Number 3(2014)
• Page Start: 190
• Page End: 197
• Publication Date: 2014-01-01
• Subjects: computational grids -- grid scheduling -- hidden Markov model; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

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.