Resource Allocation Mechanism with New Models for Grid Environment

Resource allocation is playing a vital role in grid environment because of the dynamic and heterogeneous nature of grid resources. Literature offers numerous studies and techniques to solve the grid resource allocation problem. Some of the drawbacks occur during grid resource allocation are low util...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of grid and high performance computing 2013-04, Vol.5 (2), p.1-26
Hauptverfasser: Sathish, Kuppani, Reddy, A Rama Mohan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Resource allocation is playing a vital role in grid environment because of the dynamic and heterogeneous nature of grid resources. Literature offers numerous studies and techniques to solve the grid resource allocation problem. Some of the drawbacks occur during grid resource allocation are low utilization, less economic reliability and increased waiting time of the jobs. These problems were occurred because of the inconsiderable level in the code of allocating right resources to right jobs, poor economic model and lack of provision to minimize the waiting time of jobs to get their resources. So, all these drawbacks need to be solved in any upcoming resource allocation technique. Hence in this paper, the efficiency of the resource allocation mechanism is improved by proposing two allocation models. Both the allocation models have used the Genetic Algorithm to overcome all the aforesaid drawbacks. However, one of the allocation models includes penalty function and the other does not consider the economic reliability. Both the models are implemented and experimented with different number of jobs and resources. The proposed models are compared with the conventional resource allocation models in terms of utilization, cost factor, failure rate and make span.
ISSN:1938-0259
1938-0267
DOI:10.4018/jghpc.2013040101