Load Balancing Mechanism in Agent-based Grid



Similar documents
LOAD BALANCING USING ANT COLONY IN CLOUD COMPUTING

Concurrent Program Synthesis Based on Supervisory Control

Design of A Knowledge Based Trouble Call System with Colored Petri Net Models

A Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm

Synopsys RURAL ELECTRICATION PLANNING SOFTWARE (LAPER) Rainer Fronius Marc Gratton Electricité de France Research and Development FRANCE

DAY-AHEAD ELECTRICITY PRICE FORECASTING BASED ON TIME SERIES MODELS: A COMPARISON

Branch-and-Price for Service Network Design with Asset Management Constraints

Web Application Scalability: A Model-Based Approach

Service Network Design with Asset Management: Formulations and Comparative Analyzes

Monitoring Frequency of Change By Li Qin

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

Project Management and. Scheduling CHAPTER CONTENTS

A MOST PROBABLE POINT-BASED METHOD FOR RELIABILITY ANALYSIS, SENSITIVITY ANALYSIS AND DESIGN OPTIMIZATION

A Certification Authority for Elliptic Curve X.509v3 Certificates

Stochastic Derivation of an Integral Equation for Probability Generating Functions

Re-Dispatch Approach for Congestion Relief in Deregulated Power Systems

ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS

Simulink Implementation of a CDMA Smart Antenna System

ANALYSING THE OVERHEAD IN MOBILE AD-HOC NETWORK WITH A HIERARCHICAL ROUTING STRUCTURE

Service Network Design with Asset Management: Formulations and Comparative Analyzes

CRITICAL AVIATION INFRASTRUCTURES VULNERABILITY ASSESSMENT TO TERRORIST THREATS

Failure Behavior Analysis for Reliable Distributed Embedded Systems

An important observation in supply chain management, known as the bullwhip effect,

THE RELATIONSHIP BETWEEN EMPLOYEE PERFORMANCE AND THEIR EFFICIENCY EVALUATION SYSTEM IN THE YOTH AND SPORT OFFICES IN NORTH WEST OF IRAN

Softmax Model as Generalization upon Logistic Discrimination Suffers from Overfitting

Software Cognitive Complexity Measure Based on Scope of Variables

Static and Dynamic Properties of Small-world Connection Topologies Based on Transit-stub Networks

CABRS CELLULAR AUTOMATON BASED MRI BRAIN SEGMENTATION

X How to Schedule a Cascade in an Arbitrary Graph

An inventory control system for spare parts at a refinery: An empirical comparison of different reorder point methods

Multistage Human Resource Allocation for Software Development by Multiobjective Genetic Algorithm

Optimal Routing and Scheduling in Transportation: Using Genetic Algorithm to Solve Difficult Optimization Problems

A Third Generation Automated Teller Machine Using Universal Subscriber Module with Iris Recognition

Implementation of Statistic Process Control in a Painting Sector of a Automotive Manufacturer

Migration to Object Oriented Platforms: A State Transformation Approach

Dynamic Load Balance for Approximate Parallel Simulations with Consistent Hashing

Machine Learning with Operational Costs

A Modified Measure of Covert Network Performance

Efficient Training of Kalman Algorithm for MIMO Channel Tracking

Time-Cost Trade-Offs in Resource-Constraint Project Scheduling Problems with Overlapping Modes

Storage Basics Architecting the Storage Supplemental Handout

Buffer Capacity Allocation: A method to QoS support on MPLS networks**

Sage Document Management. User's Guide Version 13.1

Managing specific risk in property portfolios

Modeling and Simulation of an Incremental Encoder Used in Electrical Drives

Local Connectivity Tests to Identify Wormholes in Wireless Networks

Comparing Dissimilarity Measures for Symbolic Data Analysis

The Online Freeze-tag Problem

Drinking water systems are vulnerable to

An Efficient NURBS Path Generator for a Open Source CNC

Rummage Web Server Tuning Evaluation through Benchmark

Estimation of Reliability of a Interleaving PFC Boost Converter

An Introduction to Risk Parity Hossein Kazemi

MODELLING AND SIMULATION OF A DISH STIRLING SOLAR ENGINE. Sergio Bittanti Antonio De Marco Marcello Farina Silvano Spelta

IEEM 101: Inventory control

Moving Objects Tracking in Video by Graph Cuts and Parameter Motion Model

On the predictive content of the PPI on CPI inflation: the case of Mexico

Use of Agent-Based Service Discovery for Resource Management in Metacomputing Environment

Response-Time Control of a Processor-Sharing System Using Virtualized Server Environments Kjaer, Martin Ansbjerg; Kihl, Maria; Robertsson, Anders

STATISTICAL CHARACTERIZATION OF THE RAILROAD SATELLITE CHANNEL AT KU-BAND

C-Bus Voltage Calculation

Sage Timberline Office

Automatic Search for Correlated Alarms

Ant Colony Optimization for the Traveling Salesman Problem Based on Ants with Memory

Memory management. Chapter 4: Memory Management. Memory hierarchy. In an ideal world. Basic memory management. Fixed partitions: multiple programs

Sage Document Management. User's Guide Version 12.1

Point Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)

An Associative Memory Readout in ESN for Neural Action Potential Detection

FDA CFR PART 11 ELECTRONIC RECORDS, ELECTRONIC SIGNATURES

Jena Research Papers in Business and Economics

Design and Development of Decision Making System Using Fuzzy Analytic Hierarchy Process

Numerical Simulation of Sand Erosion Phenomena in Rotor/Stator Interaction of Compressor

Secure synthesis and activation of protocol translation agents

Factoring Variations in Natural Images with Deep Gaussian Mixture Models

An optimal batch size for a JIT manufacturing system

An Analysis Model of Botnet Tracking based on Ant Colony Optimization Algorithm

F inding the optimal, or value-maximizing, capital

Franck Cappello and Daniel Etiemble LRI, Université Paris-Sud, 91405, Orsay, France

From Simulation to Experiment: A Case Study on Multiprocessor Task Scheduling

Characterizing and Modeling Network Traffic Variability

Risk in Revenue Management and Dynamic Pricing

On Multicast Capacity and Delay in Cognitive Radio Mobile Ad-hoc Networks

Compensating Fund Managers for Risk-Adjusted Performance

COST CALCULATION IN COMPLEX TRANSPORT SYSTEMS

Transcription:

Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 57-62 Available online at www.isacs.com/cacsa Volume 2016, Issue 1, Year 2016 Article ID cacsa-00042, 6 Pages doi:10.5899/2016/cacsa-00042 Research Article Load Balancing Mechanism in Agent-based Grid Hamideh Gharehjehdaghi 1, Abdolreza Hatamlou 1*, Ramin Jafarzadeh 1 (1) Deartment of Comuter Science, Faculty of Sciences, Islamic Azad University Khoy Branch, Khoy, Iran Coyright 2016 Hamideh Gharehjehdaghi, Abdolreza Hatamlou and Ramin Jafarzadeh. This is an oen access article distributed under the Creative Commons Attribution License, which ermits unrestricted use, distribution, and reroduction in any medium, rovided the original wor is roerly cited. Abstract Grid is a comuting extensive comutational environment that maes the enormous rocessing ower for distributed rocessing. Grid resource management is imortant and for agent-based aroach is a way to manage its resources. Load balancing is an imortant section resource management system. Paer model of multilevel load balancing in grid and ARMS environments rovided, resource management model rovided that the estimate is load node. In the First level of model, using genetic algorithm is used for load balancing nodes between internal resources. That is, in the second level, Add method of the neighborhood and overloaded nodes are added to the rainfall distribution in the limited area around the layer. The third level is the ecosystem is one of the intelligent ants, each method is a method of load balancing. Picing methods In a multilevel structure is called MLBM that eliminates the disadvantages and satisfies the majority of the load balancing roerties. The results show that the model is suerior to its redecessors gain in increasing roductivity and reduction srbarartbaty. Keywords: Grid, load balancing, ARMS, MLBM 1 Introduction The main of comonents of the grid architecture are [1]: Infrastructure grid is comosed of resources national grid that can be accessed through the Internet. Resources, include comuters, suercomuters, databases and are etc. Grid services offers things, such as information, communication, naming, resource management, security, etc. Grid tools offer high level services, including seech, rogramming interfaces, develoment tools and troubleshooting tools. Grid alications include distributed suercomuting alications in a wide range, including comutations with high throughut and high volume of data to be included. ARMS is agentbased resource manager for grid comuting. oerating softwares are comuter systems that have the ability of flexible and autonomous functions in unredicatable environment [1]. In ARMS system, agents wor together for resource discovery to. Each agent information resources ees that manages in the form of tables, called ACT. Agents are equied with tools to redict the erformance * Corresonding Author. Email address: Hatamlou@iauhoy.ac.ir; Tel: +98 9144627893 57

Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 57-62 58 htt://www.isacs.com/journals/cacsa/2016/cacsa-00042/ of the PACE [2]. Due to the lac of a balanced use of resources in the ARMS system load balancing method is used. The urose algorithms balance the uniformly distributed load on resources and maximize resource efficiency and low overall execution time tas [2]. This aer offers, multi-layer load balancing mechanism for ARMS. The model is MLBM and is a three-level model in which each level erforms load balancing. 2 Preliminaries and notations Grid, in terms of environmental and structural conditions,has major differences with its redecessor's distributed systems,as a result it can not load balancing algorithms for distributed systems used in comutational grids. Load balancing is an otimization roblem and the heuristicare are to achieve relatively good results in a reasonable time. Accordingly, the existing load balancing methods for load balancing heuristic methods are the following: Genetic algorithm is a heuristic efficient load balancing. Foundations A.zomaya and colleagues have examined the use of genetic algorithms for load balancing. The use of collective intelligence that was first roosed by Dorigo as a multi-agent aroach for combinatorial otimization roblems is resented. Using neural networs, fuzzy logic, intelligent agents using and aroximate methods other methods are of research in the field of load balancing. In 2001, ARMS was resented in j.cao doctoral thesis, in the system of resources managerment of the agents that are equied with a means to Predictive erformance of the PACE have been used [3]. 3 Main section 3.1. agent-based resource management method (ARMS) Resource management system is the main comonents of the grid system and it manages a set of resources that are available to manage. ARMS maes a bridge for scheduling rograms and use of the available resources. The relationshi between the comonents is shown in Figure 1. Figure 1: ARMS structure Resource Management Model PACE: Providing quantitative data on the erformance of comlex alications running on local resources AT: A art of PACE in which the rogram is run by user should have a model, called the AT model RT: Means any source that rovides secific source of the resource model EE: Or assessment engine to another art of the PACE that erforms oerations erformance evaluation [4]. A4: Used for oerations management sources at the oerating level and it maes [5] will be oerating Agent in a series hierarchical structure. PMA: The simulator A4 is the main art of it. The tas of this agent is monitoring and regulating the behavior of other agents to increase the efficiency of the whole system. 3.2. Existing methods for load balancing Load balancing method uses genetic algorithm [5] and methods collective intelligence such as methods based on ants.

Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 57-62 59 htt://www.isacs.com/journals/cacsa/2016/cacsa-00042/ 3.2.1. Using Genetic Algorithms j.cao et [6], rovided a way for load balancing in ARMS. This algorithm erforms load balancing in the node by the scheduler. So that the whole rocesses can be comleted before the deadline, and an efficient way has to imlement the rocesses waiting in a node and from genetic algorithm is used. Figure 2 shows the architecture of the system: Tas Management: request enters this area and queues for schedule be rocessed by genetic algorithms. Resource Monitoring: the tas of collecting statistical data related to the rocessors on which wor is to be done. Tas Execution: The tas of erforming a rogram related to a rogram on the list of scheduled rocessors. PACE Evaluation Engine: Is taes on obtaining data on the time of running rocessing using the rogram model and the resource model. Figure 2: Algorithm architecture in the local management ARMS 3.2.2. Using Collective Intelligence An algorithm, called Messor, was resented for load balancing in grid [7] ants can be laced in the states of Search-Max and Search-Min during their life in this system. In the states of Search-Max, an ant moves randomly to find an overloaded a node. Then ant goes to the states of Search-Min to find the an underloaded node. Load means the number of elements available in each node. Then ant does the balancing act between two nodes. When the ants move to a node leaves, data about nodes which until then had met for other ants. Ant-based algorithm roosed in ARMS is similar to messor method and acts as follows: 1. An ant goes from one agent to another agent, and tries to remember the characteristics of the factor with high load. 2. After traversing M ste and finding an agent with the highest load factor, the ant changes stateand remember characteristics of agent with minimum load. 3. After traversing M ste and finding on agent with the minimum load factor, Ant stos one ste and rooses load balancing between the minimum and maximum load. 4. After erforming load balancing, loo is reeated from ste 1. 3.2.3. Methods Of the Scheduler Level (QAP) methods to set the queue length In this way, the scheduler laces between queue and the rocessor and erforms the of regulation queue length according to adjacent nodes, queue length. As shown in figure 3, if the queue is removed from balance, additional rocesses are sent to other nodes.

Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 57-62 60 htt://www.isacs.com/journals/cacsa/2016/cacsa-00042/ Figure 3: Aroach based Regulation queue length (QAP) (RAP) arrival rate setting methods In this way, the scheduler laces in the arrival of the queue. As shown in figure 4, when a new job enters a node, the scheduler cleanfies that it needs to be rocessed there or it should Be sent to another node. Figure 4: Aroach based arrival rate setting (RAP) (QRAP) combined aroach It is a combination of methods to regulation of queue length and arrival rate setting, that is to say, the scheduler sets jobs arrival rate and queue length at each node. Figure 5: combined aroach (QRAP) 3.3. Multilevel load balancing mechanism in the grid comuting environment (MLBM) To overcome the disadvantages of each algorithm, combining algorithms are listed. By the method of genetic algorithm [6], ant algorithm in whole grid and load balancing algorithm in level scheduling rovide a new multi-level rocedure and this model is called MLBM. In the first hase of the algorithm an otimal way for Processes is exected to run in each node. The second level of the scheduling algorithm acts in imlemented scheduler and the neighbors of each node levels that can erform from the beginning load balancing oerations rocessing. This algorithm does not imose much load on the system and erforms load balancing at neighboring nodes level with resect to the cost of dehvering node. The third level of ant algorithm is used to balance the load and load is sread between different nodes. Each node eriodically gathers information about what the neighbors do. At the same time ants may have assed from the node and if they diagnose rich node or less load is sread, remember to balance it out. If ants remain for consecutive

Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 57-62 61 htt://www.isacs.com/journals/cacsa/2016/cacsa-00042/ eriods by alying the algorithm to the neighborhood of full load, nodes can build an ant and send it to system. Along with these two algorithms genetic algorithm in the node tries to create an otimal schedule for the node. Since the radius of distribution of neighborhood algorithm level is low to do this ant algorithm is used and weaness is of ants way of increasing the number of ants, therefore, in use of ant algorithms and the neighborhood algorithm, the neighborhood algorithm diserses load in the environment resulting in the use of fewer ants to balance the load. therefore, concomitant use of two ant algorithm causes them to fix flaws. 4 Numerical examles If we assume that is the number of agents in the resource management system and the W PK (: 1, 2,..., P) load factor P in ste K, In this case average worload of the following: W 1 W Average standard deviation W PK that exresses the level of load balancing is defined as follows: L 1 ( W W ) 2 L K indicates average of the deviation agents from the overall average W K. And finally, erformance load balancing method is defined as follows: L0 L e (4.3) C In formula 3 e, load balancing erformance at ste and C has the total number of connections agents to get to L. In a trial to erformance evaluation the effectiveness of variety is described above. Performance method MLBM is comared with the method based intelligent ant in ARMS. The erformance calculated according to the formula (4.3) is comared together at T different times.in this test K=7 is considered. (4.1) (4.2) Figure 6: Comare the erformance of different methods roosed According to tests erformed (e) method MLBM is more than algorithm based on intelligent ant. 5 Conclusion MLBM is a multilevel model for load balancing. Its erformance occurs at three levels and while the levels are searated, the result is a erformance effect. The first level of this model is functioning within a node and with the use of genetic algorithm imlementation, In the second level there is neighborhood level load balancing algorithm that is a comonent of load balancing methods in the level of scheduler and in the third

Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 57-62 62 htt://www.isacs.com/journals/cacsa/2016/cacsa-00042/ level an ant algorithm is roosed for load balancing. Interaction of methods in Systems causes loss of flaws and as a result load balancing can be erformed with high efficiency. References [1] N. R. Jennings, M. J. Wooldridge (eds), Agent Technology: Foundations, Alications, and Marets, Sringer-Verlag, (1998). htt://dx.doi.org/10.1007/978-3-662-03678-5 [2] Mohsen Amini Salehi, Hosseain Deldari, MLBLM: A Multi-level Load Balancing Mechanism in Agent- Based Gird, sringer, 4308 (2006) 157-162. htt://dx.doi.org/10.1007/11947950_18 [3] J. Cao, D. J. Kerbyson, E. Paaefstathiou, G. R. Nudd, Performance Modelling of Parallel and Distributed Comuting Using PACE, in Proc. of 19th IEEE Int. Performance, Comuting and Communication Conf., Phoenix, USA, (2000) 485-492. htt://dx.doi.org/10.1109/pccc.2000.830354 [4] J. Cao, Agent-Based Resource Management System (ARMS), PhD Thesis, Warwic University Det. of Comuter Science, (2001). [5] J. Cao, D. J. Kerbyson, G. R. Nudd, Dynamic Alication Inteation Using Agent-Based Oerational Administration, in Proc Of 5th Int. Conf. on Practical Alication of Intelligent Agentsand Multi-Agen Tecnology, Manchester, UK, (2000) 393-396. [6] J. Cao, Daniel P. Sooner, S. A. Jarvis, S. Saini, Agent-Based Grid Load Balancing Using Performance- Driven Tas Scheduling, In Proc. of 17thIEEE Int. Parallel & Distributed Processing Symosium (IPDPS 2003), Nice, France, Aril (2003). htt://dx.doi.org/10.1109/ipdps.2003.1213139 [7] M. Baer, R. Buyya, D. Laforenza, The Grid: A Survey on Global Efforts in Grid Comuting, Tech. Re: 2001/92, Monash University, Australia, (2001).