Resource Utilization Optimization using Genetic Algorithm based on Variation of Resource Fluctuation Moment for Extra-Large Building Renovation

Author(s):  
Pornpote Nusen ◽  
Pratch Piyawongwisal ◽  
Sunita Nusen ◽  
Manop Kaewmoracharoen
2012 ◽  
pp. 669-679
Author(s):  
Dominic Cherry ◽  
Maozhen Li ◽  
Man Qi

This chapter presents MediaGrid, a distributed storage system for archiving broadcast media contents. MediaGrid utilizes storage resources donated by computing nodes running in a distributed computing environment. A genetic algorithm for resource selection is built in MediaGrid with the aim to optimize the utilization of resources available for archiving media files with various sizes. Evaluation results show the effectiveness of MediaGrid in archiving broadcast media contents, and the performance of the genetic algorithm in resource utilization optimization


2014 ◽  
Vol 513-517 ◽  
pp. 2031-2034
Author(s):  
Hui Zhang ◽  
Yong Liu

Virtual machine migration is an effective method to improve the resource utilization of cloud data center. The common migration methods use heuristic algorithms to allocation virtual machines, the solution results is easy to fall into local optimal solution. Therefore, an algorithm called Migrating algorithm based on Genetic Algorithm (MGA) is introduced in this paper, which roots from genetic evolution theory to achieve global optimal search in the map of virtual machines to target nodes, and improves the objective function of Genetic Algorithm by setting the resource utilization of virtual machine and target node as an input factor into the calculation process. There is a contrast between MGA, Single Threshold (ST) and Double Threshold (DT) through simulation experiments, the results show that the MGA can effectively reduce migrations times and the number of host machine used.


Author(s):  
Dominic Cherry ◽  
Maozhen Li ◽  
Man Qi

This chapter presents MediaGrid, a distributed storage system for archiving broadcast media contents. MediaGrid utilizes storage resources donated by computing nodes running in a distributed computing environment. A genetic algorithm for resource selection is built in MediaGrid with the aim to optimize the utilization of resources available for archiving media files with various sizes. Evaluation results show the effectiveness of MediaGrid in archiving broadcast media contents, and the performance of the genetic algorithm in resource utilization optimization.


Author(s):  
Deepika Saxena ◽  
Ashutosh Kumar Singh

Background: Load balancing of communication-intensive applications, allowing efficient resource utilization and minimization of power consumption is a challenging multi-objective virtual machine (VM) placement problem. The communication among inter-dependent VMs, raises network traffic, hampers cloud client's experience and degrades overall performance, by saturating the network. Introduction: Cloud computing has become an indispensable part of Information Technology (IT), which supports the backbone of digitization throughout the world. It provides shared pool of IT resources, which are: always on, accessible from anywhere, at anytime and delivered on demand, as a service. The scalability and pay-per-use benefits of cloud computing has driven the entire world towards on-demand IT services that facilitates increased usage of virtualized resources. The rapid growth in the demands of cloud resources has amplified the network traffic in and out of the datacenter. Cisco Global Cloud Index predicts that by the year 2021, the network traffic among the devices within the datacenter will grow at Compound Annual Growth Rate (CAGR) of 23.4% Methods: To address these issues, a communication cost aware and resource efficient load balancing (CARE-LB) framework is presented, that minimizes communication cost, power consumption and maximize resource utilization. To reduce the communication cost, VMs with high affinity and inter-dependency are intentionally placed closer to each other. The VM placement is carried out by applying the proposed integration of Particle Swarm Optimization and non-dominated sorting based Genetic Algorithm i.e. PSOGA algorithm encoding VM allocation as particles as well as chromosomes. Results: The performance of proposed framework is evaluated by the execution of numerous experiments in the simulated datacenter environment and it is compared with the state-of-the-art methods like, Genetic Algorithm, First-Fit, Random-Fit and Best-Fit heuristic algorithms. The experimental outcome reveals that the CARE-LB framework improves 11% resource utilization, minimize 4.4% power consumption, 20.3% communication cost with reduction of execution time up to 49.7% over Genetic Algorithm based Load Balancing framework. Conclusion: The proposed CARE-LB framework provides promising solution for faster execution of data-intensive applications with improved resource utilization and reduced power consumption. Discussion: In the observed simulation, we analyze all the three objectives, after execution of the proposed multi-objective VM allocations and results are shown in Table 4. To choose the number of users for analysis of communication cost, the experiments are conducted with different number of users. For instance, for 100 VMs we choose 10, 20,...,80 users, and their request for VMs (number of VMs and type of VMs) are generated randomly, such that the total number of requested VMs do not exceed number of available VMs.


Load balancing has been the focus of research over the current days in many domains but more importantly they are crucial for distributed computing. The research mainly focuses towards distributing load based on the current usage of nodes to facilitate effective resource utilization and obtain better performance from the system. Balancing load is to distribute the tasks on to the available or idle nodes so that resources are utilized fairly in a distributed environment. By developing strategies to assign the processes on a heavily loaded processor to an idle/under loaded processor in a way that balances out the load, the total processing time can be reduced hence achieving improved processor utilization. Genetic Algorithm(GA) is a search based approach that is robust and that can adapt to the search space for optimizing the solution are gaining immense popularity. GA in the proposed work considers the load as a parameter to evaluate fitness of the strings. The strings are also generated based on the load information of the nodes. The fitness evaluates the strings to identify only the underutilized or idle nodes which can take the transmitted load. Hence the work proposed explores and illustrates how GA could be employed to solve the problem of dynamic load-balancing


Recent researches in cloud discusses about the application response testing, performance testing, security testing and many more, but still there is a lack of researches addressing issues like resource utilization and user interactions in cloud SaaS testing. The load on the cloud, SaaS instance keeps varying dynamically with respect to time, it is difficult to find the exact load at a particular interval of time. One does not know where to look for the solution and where to start, this made SaaS instances non deterministic in nature. In order to find a solution for such non deterministic problems, we make use of Genetic Algorithm which is considered as a good solution for non-deterministic problems.We determine the optimized resources that a cloud instance, would need to manage the dynamic load at all times. Toaddress the resource utilization of a group of users in MultiTenant Architecture (MTA), we adopt Genetic Algorithm which uses a popular technique, called neighborhood search and instance ranking policy. The basic concept of this paper is to explore the neighbors of an existing solution, that is considered as the solutions which can be obtained with a specific operation on the base population. In addition to that,this paper discusses about the ranking of all the available population and select the most highly ranked one. Instance ranking policies are aimed at minimizing the number of nodes in use or maximize the resources available to each node in an instance.


2011 ◽  
Vol 421 ◽  
pp. 717-723
Author(s):  
Liang Dong ◽  
Zhen Guo Yan ◽  
Jie Zhang ◽  
Kun Peng Du ◽  
Yan Ping Wang

In a discrete assembly system, setting its optimal production status is one of the key works in assembly line balancing. Based on analyzing the objectives of assembly line control, a general flow for setting the optimal production status is proposed, and a method to identify rapidly the setting objects of production status is introduced. Then an optimal configuration solution for production status and its solving method in a station of an assembly line are established based on the genetic algorithm. At last, a wing assembly line is set as an example to validate this method, and the result shows that this method can provide a solution to optimize production status parameters for each station in this assembly line, which can reduce the resource idle time and cost, and so its resource utilization rate is improved.


2011 ◽  
Vol 63-64 ◽  
pp. 637-642
Author(s):  
Zhan Jun Liu ◽  
Cheng Chao Liang ◽  
Yang Wang ◽  
Cong Ren

Considering the restriction of physical resource and the environment, we propose a new broadcast path algorithm based on genetic algorithm and ideal point model. The proposed algorithm combines multiple constrains and utilizes the advantages of genetic algorithm in multiple objective programming. Simulation results show that the proposed algorithm reveal better performance on efficiency resource utilization.


Sign in / Sign up

Export Citation Format

Share Document