Resource Allocation Mechanism with New Models for Grid Environment

2013 ◽  
Vol 5 (2) ◽  
pp. 1-26
Author(s):  
Kuppani Sathish ◽  
A. Rama Mohan Reddy
Keyword(s):  
Resource Allocation ◽  
Waiting Time ◽  
Vital Role ◽  
Allocation Mechanism ◽  
Grid Resource ◽  
Grid Environment ◽  
Grid Resources ◽  
Utilization Cost ◽  
Resource Allocation Mechanism ◽  
Grid Resource Allocation

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.

scholarly journals An Efficient Resource Allocation Mechanism for LTE–GEPON Converged Networks

2013 ◽  
Vol 22 (3) ◽  
pp. 437-461 ◽  
Author(s):  
Chathurika Ranaweera ◽  
Elaine Wong ◽  
Christina Lim ◽  
Ampalavanapillai Nirmalathas ◽  
Chamil Jayasundara
Keyword(s):  
Resource Allocation ◽  
Allocation Mechanism ◽  
Efficient Resource ◽  
Resource Allocation Mechanism

Grid Resource Allocation with Genetic Algorithm Using Population Based on Multisets

2017 ◽  
Vol 26 (1) ◽  
pp. 169-184 ◽  
Author(s):  
Absalom E. Ezugwu ◽  
Nneoma A. Okoroafor ◽  
Seyed M. Buhari ◽  
Marc E. Frincu ◽  
Sahalu B. Junaidu
Keyword(s):  
Genetic Algorithm ◽  
Resource Allocation ◽  
Grid Computing ◽  
Resource Selection ◽  
Computing System ◽  
Population Based ◽  
Fine Tuning ◽  
Grid Resource ◽  
Performance Results ◽  
Grid Resources

AbstractThe operational efficacy of the grid computing system depends mainly on the proper management of grid resources to carry out the various jobs that users send to the grid. The paper explores an alternative way of efficiently searching, matching, and allocating distributed grid resources to jobs in such a way that the resource demand of each grid user job is met. A proposal of resource selection method that is based on the concept of genetic algorithm (GA) using populations based on multisets is made. Furthermore, the paper presents a hybrid GA-based scheduling framework that efficiently searches for the best available resources for user jobs in a typical grid computing environment. For the proposed resource allocation method, additional mechanisms (populations based on multiset and adaptive matching) are introduced into the GA components to enhance their search capability in a large problem space. Empirical study is presented in order to demonstrate the importance of operator improvement on traditional GA. The preliminary performance results show that the proposed introduction of an additional operator fine-tuning is efficient in both speed and accuracy and can keep up with high job arrival rates.

Grid Resource Allocation

2009 ◽  
pp. 171-190
Author(s):  
Zhou Lei ◽  
Zhifeng Yun ◽  
Gabrielle Allen
Keyword(s):  
Resource Allocation ◽  
Grid Resource ◽  
Grid Resource Allocation

scholarly journals Modeling a holonic agent based solution by Petri nets

2012 ◽  
Vol 9 (3) ◽  
pp. 1287-1305 ◽  
Author(s):  
Carlos Pascal ◽  
Doru Panescu
Keyword(s):  
Resource Allocation ◽  
Petri Nets ◽  
Petri Net ◽  
Coordination Mechanisms ◽  
Allocation Mechanism ◽  
Simulation Experiments ◽  
Agent Based ◽  
Manufacturing Execution Systems ◽  
Resource Allocation Mechanism ◽  
Manufacturing Execution

One of the key design issues for distributed systems is to find proper planning and coordination mechanisms when knowledge and decision capabilities are spread along the system. This contribution refers holonic manufacturing execution systems and highlights the way a proper modeling method - Petri nets - makes evident certain problems that can appear when agents have to simultaneously treat more goals. According to holonic organization the planning phase is mainly dependent on finding an appropriate resource allocation mechanism. The type of weakness is established by means of the proposed Petri net models and further proved by simulation experiments. A solution to make the holonic scheme avoid a failure in resource allocation is mentioned, too.

scholarly journals A Weight-based Query Forwarding Technique for Super-peer-based Grid Resource Discovery

2017 ◽  
Vol 7 (1) ◽  
pp. 1398-1404
Author(s):  
M. Mollamotalebi ◽  
R. Maghami ◽  
A. S. Ismail
Keyword(s):  
Response Time ◽  
Resource Discovery ◽  
Search Process ◽  
Grid Resource ◽  
Grid Environment ◽  
Grid Applications ◽  
Computing Environments ◽  
Grid Resources ◽  
Grid Resource Discovery ◽  
Super Peer

Grid computing environments include heterogeneous resources shared by a large number of computers to handle data and process intensive applications. The required resources must be accessible for the grid applications on demand, which makes resource discovery a critical service. In recent years, different techniques are provided to index and discover grid resources. Response time and message load during the search process highly affect the efficiency of resource discovery. This paper proposes a technique to forward the queries based on the resource types accessible through each neighbor in super-peer-based grid resource discovery approaches. The proposed technique is simulated in GridSim and the experimental results indicated that it is able to reduce the response time and message load during the search process especially when the grid environment contains a large number of nodes.

Sign in / Sign up

Export Citation Format

Share Document