A New Hybrid Load Balancing Algorithm in Grid Computing Systems
|
|
- Meryl Riley
- 7 years ago
- Views:
Transcription
1 A New Hybrid Load Balancing Algorithm in Grid Computing Systems Leyli Mohammad Khanli 1, Behnaz Didevar 2 1 University of Tabriz, Department of Computer Science, 2 Department of Technical and Engineering, Islamic Azad University of Tabriz, {L-khanli@tabrizu.ac.ir, behnaz_didevar@yahoo.com} 304 Abstract - Grid computing systems are distributed systems developed by the integration of heterogeneous resources with various characteristics. These heterogeneous computing resources are used to run highly complex programs that require very high processing power and huge volume of input data. Therefore, as a result of a large number of resources and their heterogeneity administration of these resources is an important issue in computing systems. Our intention is to develop a new algorithm for creating load balancing in these systems. In this paper, we have presented a new algorithm which is a combination of static and dynamic load balancing. In this algorithm, we have defined a time range called Update Interval which in the basis of Update Interval, the information in the table of effective nodes is updated. The advantage of this method is that, it reduces the delay and deadlock significantly. Simulation results indicate that our proposed algorithm can reduce the wait time of the tasks and subsequently their completion time and the delay in execution time of the tasks decreased. Keywords: Grid computing, Update Interval, Task, Completion time, delay. 1. Introduction Grid computing systems are distributed systems developed by a set of heterogeneous resources, which these heterogeneous computing resources can include PCs, supercomputers, clusters, data storing devices, data banks, softwares and etc. [1]. Currently, Grid computing technology can be used to connect heterogeneous computing resources to each other in a way that user can regard all of this structure as a single machine on which we can run very highly complex and massive application programs that require a high processing power and huge volume of input data [1]. Grid is not limited in terms of the geographical range of the resources that it covers and each resource may belong to different institutes, organizations and individuals which are operated in Grid according to policies set by their owners and these owners may receive some money for the utilization of their resource [1]. One of the algorithms proposed for load balancing is genetic algorithm which uses both static and dynamic load balancing methods [2]. However, this algorithm is suitable for an environment with low number of applications. Otherwise, this algorithm will lead to International Journal of Computer Science & Emerging Technologies IJCSET, E-ISSN: Copyright ExcelingTech, Pub, UK ( information overload in the environment. Another combined algorithm proposed for load balancing is the load balancing algorithm based on the table of effective nodes in which as long as there is no change in the status of the system, the method of static load balancing is used, but as soon as there is a change of status in system, dynamic load balancing is used to update the table [3]. The most important disadvantage of this method is that a task may be kept waiting for a long time, because the table of effective nodes is not updated frequently. In our proposed method, we have presented an algorithm in which we have defined a time range called Update Interval (U-I) which in the basis of U-I, the information in the table of effective nodes is updated and as, the system administrator will be aware of any outgoing and incoming nodes or whether they are busy. Thus, by using this algorithm, the execution of tasks will not be delayed and also a node will not be in an undesirable busy status. We have simulated our proposed algorithm for various nodes by using one of the different programs available for simulation. The simulation results indicate that, as the proposed algorithm is applied, the wait time of tasks in queue and, their completion time is reduced significantly. The contents of different sections of this paper are as follow: The second section of the study focuses on related works. The structure of the system environment and proposed algorithm are detailed in the third section. The fourth section focuses on simulation method and analysis the result of proposed algorithm to verify if the proposed system could achieve the goal of increasing system performance better than other systems. In the fifth section the conclusions and future works are presented. 2. Related work Generally, there are two methods for creating load balancing in Grid environment: static load balancing which is based on static information such as CPU capacity, memory space and etc. and dynamic load balancing which is based on current status of the system [4]-[5]. In some algorithms the combination of these two methods are used which they are referred to as combined algorithms. One of these combined algorithms is the load balancing algorithm based on the table of effective
2 305 nodes [3]. The table of effective nodes is developed after the dispatcher provide a number called node value to each resources (nodes) using the method of static load balancing and store them in a table called table of effective nodes [3]. When a request for executing a task is proposed, dispatcher select effective nodes set from a table of effective nodes and assigns subtasks to selected nodes [3]. Now, if a node after receiving a task sends a message to dispatcher that it can no longer provide resource, or the execution of a certain node exceeds the expected time, the dispatcher updates the information in table of effective nodes [3]. In this method first, a node receives a task and then, since it can not provide the resource, it sends a message to dispatcher that this is a disadvantage for this method. Thus on one hand, the node is kept in an undesirable busy status for a while and on the other hand, the task is kept waiting for a response for a long time, consequently the execution of that task is delayed. But with our proposed algorithm the information in table of effective nodes is updated in the basis of a defined time range that the delay in execution time of tasks decreased. Another combined algorithm proposed for load balancing is Basic Hybrid algorithm in which that is used the combination of two methods of Deferred and Random. The Deferred method uses the dynamic information of the site and the Random method uses the static information of the site [6]. In this algorithm a time range called Allocation Interval (A-I) has been defined which in the basis of A-I, the load information of each site is updated and stored in a table [6]. In a similar way, we update the information in the table of effective nodes in the basis of Update Interval (U-I), but the only difference is that, the mentioned method uses dynamic site load information for table, whereas in our proposed method we use static information of nodes such as remaining capacity of CPU, remaining memory and etc. Another combined algorithm which is the extension of Basic Hybrid method, is Previous Analogous Distribution (PAD) algorithm through which the load information of each site is updated in the basis of double A-I and stored in the table. Since the load information of each site is not available in first A-I, the number of tasks is estimated in each site [6]. In contrast, our proposed algorithm does not use any estimation. Some of the algorithms have been developed by using genetic algorithm through which the selection of the nodes are done by genetic operators which include three operators of reproduction, exchange and mutation [2]-[7]. There are also a number of algorithms that use the tree method for load balancing which the most important idea of these methods is the use of hierarchical method [8]-[9]. 3. Proposed method In this section first, the structure of proposed system environment is presented. Then the detail of proposed algorithm is described System Model The model of our proposed method is shown in Fig.1a. The base of our proposed model is derived from J.S.Lin, K.Q.Yan, S.C.Wang, C.P.Chang model [3]. The only difference is that, we have added a timer to our proposed model which calculates the Update Interval (U-I). This means that since a time as long as one U-I has elapsed, timer inform the dispatcher about that and dispatcher start to do the next stages. The difference between the previous model [3] and our proposed model is that, in our model the application of agent and dispatcher is repeated on the basis of U-I. As the information of dispatcher is always up-to-date in our model, and the dispatcher will be aware of any incoming or outgoing node so that node doesn t have to send join or exit message to the dispatcher. Because it would be necessary to send these messages to the dispatcher, if there was not any updated information. The role of each section of the system model have been described in the flowchart of Fig.1b New Hybrid (NH) Algorithm We introduce a new algorithm which we call New Hybrid (NH). Our proposed algorithm is implemented in two stages: the first stage is derived from J.S.Lin, K.Q.Yan, S.C.Wan, C.P.Chang method [3]. First the table of effective nodes is developed based on static information which this stage is referred to as static load balancing stage, and in the second stage the table of effective nodes is updated in the basis of Update Interval (U-I). The table is developed based on either the current status or dynamic information, which this stage is referred to as dynamic load balancing stage. Thus, our proposed algorithm is a combined that developed from the combination of static load balancing and dynamic load balancing. The most important difference between our proposed algorithm and the previous one [3] is that in previous method, the table of effective nodes gets updated only when a node was unable to execute the given task or it had not the resource required for that task. Thus, the unavailability of the status of nodes lead to two problems: firstly, a node that has been unable to provide the resource, is kept in an undesirable busy status. Secondly, the client who had requested the dispatcher to execute the task be kept waiting and the execution of that task be delayed. However, in our proposed method, as the information of the table get updated in the basis of U-I, the status of the nodes is available for dispatcher at any moment. Every node is provided with a task based on real and updated information of the table rather than estimated one. Thus, there will not be any node unable of executing any given task and thus any delay and undesirable busy status of a node will be avoided. The NH algorithm is shown in Fig. 2. The first line of the algorithm belongs to number 1 of Fig.1a, which is the condition of algorithm. This means that if the time that shown by timer equaled any
3 306 factor of Update Interval (U-I), algorithm would be executed. Otherwise a task arriving at dispatcher would be stored on its queue. The second line also corresponds to number 5 of Fig.1a. The third and fourth lines of the algorithm belong to number 6 of Fig.1a, which these two lines include a cycle, which the dispatcher calculates the value function [3] for N nodes. The fifth and sixth lines correspond to number 7 of Fig.1a, which these two lines include a cycle in which the dispatcher select a group of nodes, containing high function estimate between nodes. Dispatcher (1) (2) (5) Timer (8) Resource 1 Resource 2 (4) Agent (7) (6) (3) Calculation of effective nodes Node selection (a). System model Resource n Nodes Start 1. Timer sends message to dispatcher at the end of each one (U-I). 2. Dispatcher dispatches agent to collect related information of each node. 3. Agent collects related information of nodes, such as remaining CPU capability, remaining memory, etc. 4. Nodes send its own information to agent. 5. Agent provides all related information of nodes to dispatcher. 6. Dispatcher builds a table of effective nodes. 7. Dispatcher selects effective nodes set from a table of effective nodes. 8. Dispatcher assigns subtasks to selected nodes. (b). Flowchart of different roles Figure 1 - The interaction of different roles at static and dynamic load balancing End
4 If (time = n (U-I)) then { 2. Dispatcher collects all data 3. For j=1 to n do //there are totally n nodes. 4. Dispatcher computes value function. 5. For j=1 to n do 6. Dispatcher selects groups of nodes that have high value function in the table. } Figure 2 - NH algorithm 4. Simulation results and analysis This part focuses on the simulation method and its results. We use Gridsim program in our proposed algorithm [10]. The numerical value for Update Interval (U-I) has been assumed 1. We have applied the proposed algorithm on nodes with various quantity and the simulation results are shown in Tables 1 and 2. The values in Tables 1 and 2, show the rates of completion time of tasks before and after the application of New Hybrid (NH), respectively. The completion time, is the time that takes for a node to complete a task, as of the moment it entered to a queue of dispatcher. According to the definition of completion time, as the wait time of a task in a queue of a dispatcher decreases, so does the rate of its completion time. Since the values in the table of effective nodes get updated frequently, the wait time of the tasks decreases in the queue. As it can be seen from the Tables, the rate of completion time of the tasks has decreased a lot after the application of proposed method. The values of Tables 1 and 2 have been compared in diagram of Fig. 3. As it can be seen from Fig. 3, the rate of completion time of the tasks increases progressively with the increase of node quantity. Because as the number of tasks increases, the time that takes for nodes to execute the task increases, subsequently the completion time of that task increases accordingly. Now, by measuring the reduction rate of completion time of tasks in our proposed method, the reduction rate for nodes with the quantities of N=100 and N=1000 are as much as 13% and 17%, respectively. This means that we have been able to achieve at least an improvement of about 13%. In other words, the wait time of tasks in dispatcher queue, decreases at least 13%. This reduction is due to values of the table of effective nodes being updated in the basis of U-I which enable the dispatcher to be aware of the status of all nodes at any moment and consequently, any wrong utilization of nodes with tasks is avoided. Table 1 - Rate of Completion time of tasks before applying of NH algorithm Number of nodes Completion time (second) Table 2 - Rate of Completion time of tasks after applying of NH algorithm Number of nodes Completion time (second)
5 Completion time (second) Int. J Comp Sci. Emerging Tech Vol-2 No 5 October, befor applying NH algorithm after applying NH algorithm Number of nodes Figure 3 - Comparison of values in tables 1 and Conclusions and future work In this paper we have introduced a new combined algorithm developed from the combination of static and dynamic load balancing, in order to create load balancing in Grid computing systems so that, to decrease the wait time of tasks and minimize the delay of task execution. We used a time range of Update Interval (U-I) to update the status of nodes in the table of effective nodes in order to have real information available about nodes rather than estimated ones. Simulation results showed that this method leads to the reduction of completion time of tasks and avoids of any delay in task execution and idle working of any node. In future researches nodes can be designed hierarchically and different classes of sites can be considered for nodes (resources) in terms of computational capacity including low, medium and high classes and the efficiency of sites can be discussed based on them. In addition, for evaluating of effectiveness of a node, load of each site can be considered into value function, so that the best site for executing the task can be selected. References [1] J. Dongarra, B. Tourancheau, Special section: Cluster and computational grids for scientific computing, Future Generation Computer Systems, 21-30, [2] Yajun Li, Yuhang Yanga, Maode Mab, Liang Zhoua, A hybrid load balancing strategy of sequential tasks For grid computing environments, Future Generation Computer Systems, , [3] K.Q. Yan, S.C. Wang, C.P. Chang, J.S. Lin, A hybrid load balancing policy underlying grid computing environment, Computer Standards & Interfaces, , [4] S.P. Dandamudi, Sensitivity evaluation of dynamic load sharing in distributed systems, IEEE Concurrency, 62-72, [5] K. Koyama, K. Shimizu, H. Ashihara, Y. Zhang, H. Kameda, Performance evaluation of adaptive load balancing policies in distributed systems, Proceedings of the Singapore International Conference on Networks/International Conference on Information Engineering, , [6] Stylianos Zikos, Helen D. Karatza, Communication cost effective scheduling policies of nonclairvoyant jobs with load balancing in a
6 309 grid, The Journal of Systems and Software, , [7] Junwei Caoa, P. Daniel Spoonerb, A. Stephen Jarvisb, R. Graham Nudd, Grid load balancing using intelligent agents, Future Generation Computer Systems, , [8] Yagoubi, Slimani, Task Load Balancing Strategy for Grid Computing, Journal of Computer Science, , [9] M. Mezmaz, N. Melab, E.G. Talbi, An efficient load balancing strategy for grid-based branch and bound algorithm, Parallel Computing, , [10] R. Buyya, M. Murshed, GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing, The Journal of Concurrency and Computation: Practice and Experience, , Author biographies Leyli Mohammad Khanli received her B.S. (1995) from Shahid Beheshti University Tehran, Iran, M.S. (2000) from IUST (Iran University of Science and Technology) University and a Ph.D. degree (2007) from IUST (Iran University of Science and Technology) University, all in computer engineering. She is currently assistant professor in the Department of Computer Science at the University of Tabriz. Her research interests include grid computing and Quality of Service management. Behnaz Didevar received her B.S. degree in Computer Engineering from Azad University of Ardabil, Iran, in She has been a M.S. student at the Azad University of Tabriz, Tabriz, Iran, since Her research interests include grid computing systems and wireless sensor networks.
A Hybrid Load Balancing Policy underlying Cloud Computing Environment
A Hybrid Load Balancing Policy underlying Cloud Computing Environment S.C. WANG, S.C. TSENG, S.S. WANG*, K.Q. YAN* Chaoyang University of Technology 168, Jifeng E. Rd., Wufeng District, Taichung 41349
More informationDynamic Adaptive Feedback of Load Balancing Strategy
Journal of Information & Computational Science 8: 10 (2011) 1901 1908 Available at http://www.joics.com Dynamic Adaptive Feedback of Load Balancing Strategy Hongbin Wang a,b, Zhiyi Fang a,, Shuang Cui
More informationImproving Performance in Load Balancing Problem on the Grid Computing System
Improving Performance in Problem on the Grid Computing System Prabhat Kr.Srivastava IIMT College of Engineering Greater Noida, India Sonu Gupta IIMT College of Engineering Greater Noida, India Dheerendra
More informationInternational Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 6, June 2015 ISSN: 2321 7782 (Online) International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
More informationAn Effective Dynamic Load Balancing Algorithm for Grid System
An Effective Dynamic Load Balancing Algorithm for Grid System Prakash Kumar #1, Pradeep Kumar #2, Vikas Kumar *3 1,2 Department of CSE, NIET, MTU University, Noida, India 3 Linux Administrator, Eurus Internetworks
More informationFair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing
Research Inventy: International Journal Of Engineering And Science Vol.2, Issue 10 (April 2013), Pp 53-57 Issn(e): 2278-4721, Issn(p):2319-6483, Www.Researchinventy.Com Fair Scheduling Algorithm with Dynamic
More informationGrid Computing Approach for Dynamic Load Balancing
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-1 E-ISSN: 2347-2693 Grid Computing Approach for Dynamic Load Balancing Kapil B. Morey 1*, Sachin B. Jadhav
More informationDesign and Implementation of Efficient Load Balancing Algorithm in Grid Environment
Design and Implementation of Efficient Load Balancing Algorithm in Grid Environment Sandip S.Patil, Preeti Singh Department of Computer science & Engineering S.S.B.T s College of Engineering & Technology,
More informationPresentation of Multi Level Data Replication Distributed Decision Making Strategy for High Priority Tasks in Real Time Data Grids
Presentation of Multi Level Data Replication Distributed Decision Making Strategy for High Priority Tasks in Real Time Data Grids Naghmeh Esmaieli Esmaily.naghmeh@gmail.com Mahdi Jafari Ser_jafari@yahoo.com
More informationWeb-based Dynamic Scheduling Platform for Grid Computing
IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.5B, May 2006 67 Web-based Dynamic Scheduling Platform for Grid Computing Oh-han Kang, and Sang-seong Kang, Dept. of Computer
More informationTask Scheduling in Hadoop
Task Scheduling in Hadoop Sagar Mamdapure Munira Ginwala Neha Papat SAE,Kondhwa SAE,Kondhwa SAE,Kondhwa Abstract Hadoop is widely used for storing large datasets and processing them efficiently under distributed
More informationLoad Balancing in the Cloud Computing Using Virtual Machine Migration: A Review
Load Balancing in the Cloud Computing Using Virtual Machine Migration: A Review 1 Rukman Palta, 2 Rubal Jeet 1,2 Indo Global College Of Engineering, Abhipur, Punjab Technical University, jalandhar,india
More informationTHE IMPACT OF DATA REPLICATION ON JOB SCHEDULING PERFORMANCE IN HIERARCHICAL DATA GRID
THE IMPACT OF DATA REPLICATION ON JOB SCHEDULING PERFORMANCE IN HIERARCHICAL DATA GRID Somayeh Abdi 1, Hossein Pedram 2, Somayeh Mohamadi 3 1 Department of Computer Engineering, Science and research branch
More informationRoulette Wheel Selection Model based on Virtual Machine Weight for Load Balancing in Cloud Computing
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 5, Ver. VII (Sep Oct. 2014), PP 65-70 Roulette Wheel Selection Model based on Virtual Machine Weight
More informationEfficient Data Replication Scheme based on Hadoop Distributed File System
, pp. 177-186 http://dx.doi.org/10.14257/ijseia.2015.9.12.16 Efficient Data Replication Scheme based on Hadoop Distributed File System Jungha Lee 1, Jaehwa Chung 2 and Daewon Lee 3* 1 Division of Supercomputing,
More informationPublic Cloud Partition Balancing and the Game Theory
Statistics Analysis for Cloud Partitioning using Load Balancing Model in Public Cloud V. DIVYASRI 1, M.THANIGAVEL 2, T. SUJILATHA 3 1, 2 M. Tech (CSE) GKCE, SULLURPETA, INDIA v.sridivya91@gmail.com thaniga10.m@gmail.com
More informationLoad Balancing Scheduling with Shortest Load First
, pp. 171-178 http://dx.doi.org/10.14257/ijgdc.2015.8.4.17 Load Balancing Scheduling with Shortest Load First Ranjan Kumar Mondal 1, Enakshmi Nandi 2 and Debabrata Sarddar 3 1 Department of Computer Science
More informationA Study on the Application of Existing Load Balancing Algorithms for Large, Dynamic, Heterogeneous Distributed Systems
A Study on the Application of Existing Load Balancing Algorithms for Large, Dynamic, Heterogeneous Distributed Systems RUPAM MUKHOPADHYAY, DIBYAJYOTI GHOSH AND NANDINI MUKHERJEE Department of Computer
More informationA new Method on Resource Scheduling in grid systems based on Hierarchical Stochastic Petri net
A new Method on Resource Scheduling in grid systems based on Hierarchical Stochastic Petri net Mohammad Shojafar Msc. Computer Eng. Computer & Elec. Department Islamic Azad Universty of Qazvin Qazvin,Iran
More informationA Bi-Objective Approach for Cloud Computing Systems
A Bi-Objective Approach for Cloud Computing Systems N.Geethanjali 1, M.Ramya 2 Assistant Professor, Department of Computer Science, Christ The King Engineering College 1, 2 ABSTRACT: There are Various
More informationGlobal Load Balancing and Primary Backup Approach for Fault Tolerant Scheduling in Computational Grid
Global Load Balancing and Primary Backup Approach for Fault Tolerant Scheduling in Computational Grid S. Gokuldev & Shahana Moideen Department of Computer Science and Engineering SNS College of Engineering,
More informationTowards a Load Balancing in a Three-level Cloud Computing Network
Towards a Load Balancing in a Three-level Cloud Computing Network Shu-Ching Wang, Kuo-Qin Yan * (Corresponding author), Wen-Pin Liao and Shun-Sheng Wang Chaoyang University of Technology Taiwan, R.O.C.
More informationA Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster
, pp.11-20 http://dx.doi.org/10.14257/ ijgdc.2014.7.2.02 A Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster Kehe Wu 1, Long Chen 2, Shichao Ye 2 and Yi Li 2 1 Beijing
More informationCloud Computing Simulation Using CloudSim
Cloud Computing Simulation Using CloudSim Ranjan Kumar #1, G.Sahoo *2 # Assistant Professor, Computer Science & Engineering, Ranchi University, India Professor & Head, Information Technology, Birla Institute
More informationMEASURING PERFORMANCE OF DYNAMIC LOAD BALANCING ALGORITHMS IN DISTRIBUTED COMPUTING APPLICATIONS
MEASURING PERFORMANCE OF DYNAMIC LOAD BALANCING ALGORITHMS IN DISTRIBUTED COMPUTING APPLICATIONS Priyesh Kanungo 1 Professor and Senior Systems Engineer (Computer Centre), School of Computer Science and
More informationImplementing Parameterized Dynamic Load Balancing Algorithm Using CPU and Memory
Implementing Parameterized Dynamic Balancing Algorithm Using CPU and Memory Pradip Wawge 1, Pritish Tijare 2 Master of Engineering, Information Technology, Sipna college of Engineering, Amravati, Maharashtra,
More informationImproved Hybrid Dynamic Load Balancing Algorithm for Distributed Environment
International Journal of Scientific and Research Publications, Volume 3, Issue 3, March 2013 1 Improved Hybrid Dynamic Load Balancing Algorithm for Distributed Environment UrjashreePatil*, RajashreeShedge**
More informationAnalysis of Scheduling Algorithms with Migration Strategies in Distributed Systems
Analysis of Scheduling Algorithms with Migration Strategies in Distributed Systems Francisca Aparecida P Pinto, Chesley B Chaves, Lucas G Leite, Francisco Herbert L Vasconcelos and Giovanni C Barroso Federal
More informationThe International Journal Of Science & Technoledge (ISSN 2321 919X) www.theijst.com
THE INTERNATIONAL JOURNAL OF SCIENCE & TECHNOLEDGE Efficient Parallel Processing on Public Cloud Servers using Load Balancing Manjunath K. C. M.Tech IV Sem, Department of CSE, SEA College of Engineering
More informationJob Scheduling in a Distributed System Using Backfilling with Inaccurate Runtime Computations
2010 International Conference on Complex, Intelligent and Software Intensive Systems Job Scheduling in a Distributed System Using Backfilling with Inaccurate Runtime Computations Sofia K. Dimitriadou Department
More informationWeb Server Software Architectures
Web Server Software Architectures Author: Daniel A. Menascé Presenter: Noshaba Bakht Web Site performance and scalability 1.workload characteristics. 2.security mechanisms. 3. Web cluster architectures.
More informationAdjacent Selection Method for Load Balancing in Distributed Network by Artificial Intelligence
Adjacent Selection Method for Load Balancing in Distributed Network by Artificial Intelligence Riyazuddin Khan 1, Mohd Haroon 2, Shahid Husain 3, Afsaruddine 4 PG Student [M.Tech], Dept. of CSE, Integral
More informationUse of Agent-Based Service Discovery for Resource Management in Metacomputing Environment
In Proceedings of 7 th International Euro-Par Conference, Manchester, UK, Lecture Notes in Computer Science 2150, Springer Verlag, August 2001, pp. 882-886. Use of Agent-Based Service Discovery for Resource
More informationPROCESS SCHEDULING ALGORITHMS: A REVIEW
Volume No, Special Issue No., May ISSN (online): -7 PROCESS SCHEDULING ALGORITHMS: A REVIEW Ekta, Satinder Student, C.R. College of Education, Hisar, Haryana, (India) Assistant Professor (Extn.), Govt.
More informationSCHEDULING IN CLOUD COMPUTING
SCHEDULING IN CLOUD COMPUTING Lipsa Tripathy, Rasmi Ranjan Patra CSA,CPGS,OUAT,Bhubaneswar,Odisha Abstract Cloud computing is an emerging technology. It process huge amount of data so scheduling mechanism
More informationA Survey on Load Balancing and Scheduling in Cloud Computing
IJIRST International Journal for Innovative Research in Science & Technology Volume 1 Issue 7 December 2014 ISSN (online): 2349-6010 A Survey on Load Balancing and Scheduling in Cloud Computing Niraj Patel
More informationComparison of Request Admission Based Performance Isolation Approaches in Multi-tenant SaaS Applications
Comparison of Request Admission Based Performance Isolation Approaches in Multi-tenant SaaS Applications Rouven Kreb 1 and Manuel Loesch 2 1 SAP AG, Walldorf, Germany 2 FZI Research Center for Information
More information@IJMTER-2015, All rights Reserved 355
e-issn: 2349-9745 p-issn: 2393-8161 Scientific Journal Impact Factor (SJIF): 1.711 International Journal of Modern Trends in Engineering and Research www.ijmter.com A Model for load balancing for the Public
More informationHierarchical Status Information Exchange Scheduling and Load Balancing For Computational Grid Environments
IJCSNS International Journal of Computer Science and Network Security, VOL.0 No.2, February 200 77 Hierarchical Status Information Exchange Scheduling and Load Balancing For Computational Grid Environments
More informationOnline Farsi Handwritten Character Recognition Using Hidden Markov Model
Online Farsi Handwritten Character Recognition Using Hidden Markov Model Vahid Ghods*, Mohammad Karim Sohrabi Department of Electrical and Computer Engineering, Semnan Branch, Islamic Azad University,
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 MOTIVATION OF RESEARCH Multicore processors have two or more execution cores (processors) implemented on a single chip having their own set of execution and architectural recourses.
More informationAdaptive Scheduling for QoS-based Virtual Machine Management in Cloud Computing
Yang Cao, Cheul Woo Ro : Adaptive Scheduling for QoS-based Virtual Machine Management in Cloud Computing 7 http://dx.doi.org/10.5392/ijoc.2012.8.7 Adaptive Scheduling for QoS-based Virtual Machine Management
More informationLoad Balancing Algorithms in Cloud Environment
International Conference on Systems, Science, Control, Communication, Engineering and Technology 50 International Conference on Systems, Science, Control, Communication, Engineering and Technology 2015
More informationA Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters
A Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters Abhijit A. Rajguru, S.S. Apte Abstract - A distributed system can be viewed as a collection
More informationAN ADAPTIVE DISTRIBUTED LOAD BALANCING TECHNIQUE FOR CLOUD COMPUTING
AN ADAPTIVE DISTRIBUTED LOAD BALANCING TECHNIQUE FOR CLOUD COMPUTING Gurpreet Singh M.Phil Research Scholar, Computer Science Dept. Punjabi University, Patiala gurpreet.msa@gmail.com Abstract: Cloud Computing
More informationWebpage: www.ijaret.org Volume 3, Issue XI, Nov. 2015 ISSN 2320-6802
An Effective VM scheduling using Hybrid Throttled algorithm for handling resource starvation in Heterogeneous Cloud Environment Er. Navdeep Kaur 1 Er. Pooja Nagpal 2 Dr.Vinay Guatum 3 1 M.Tech Student,
More informationCLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,
More informationA Scheme for Implementing Load Balancing of Web Server
Journal of Information & Computational Science 7: 3 (2010) 759 765 Available at http://www.joics.com A Scheme for Implementing Load Balancing of Web Server Jianwu Wu School of Politics and Law and Public
More informationLoad Balancing with Tasks Subtraction
Load Balancing with Tasks Subtraction Ranjan Kumar Mondal 1 Department of Computer Science & Engineering, University of Kalyani, Kalyani, India Payel Ray 2 Department. Computer Science & Engineering, University
More informationSla Aware Load Balancing Algorithm Using Join-Idle Queue for Virtual Machines in Cloud Computing
Sla Aware Load Balancing Using Join-Idle Queue for Virtual Machines in Cloud Computing Mehak Choudhary M.Tech Student [CSE], Dept. of CSE, SKIET, Kurukshetra University, Haryana, India ABSTRACT: Cloud
More informationA Distributed Render Farm System for Animation Production
A Distributed Render Farm System for Animation Production Jiali Yao, Zhigeng Pan *, Hongxin Zhang State Key Lab of CAD&CG, Zhejiang University, Hangzhou, 310058, China {yaojiali, zgpan, zhx}@cad.zju.edu.cn
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 4, April-2015 36 ISSN 2229-5518
International Journal of Scientific & Engineering Research, Volume 6, Issue 4, April-2015 36 An Efficient Approach for Load Balancing in Cloud Environment Balasundaram Ananthakrishnan Abstract Cloud computing
More informationA Novel Load Balancing Algorithms in Grid Computing
A Novel Load Balancing Algorithms in Grid Computing Shikha Gautam M.Tech. Student Computer Science SITM LKO Abhay Tripathi Assistant Professor Computer Science SITM LKO Abstract: The Grid is emerging as
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationA SIMULATOR FOR LOAD BALANCING ANALYSIS IN DISTRIBUTED SYSTEMS
Mihai Horia Zaharia, Florin Leon, Dan Galea (3) A Simulator for Load Balancing Analysis in Distributed Systems in A. Valachi, D. Galea, A. M. Florea, M. Craus (eds.) - Tehnologii informationale, Editura
More informationAnalysis and Comparison of CPU Scheduling Algorithms
Analysis and Comparison of CPU Scheduling Algorithms Pushpraj Singh 1, Vinod Singh 2, Anjani Pandey 3 1,2,3 Assistant Professor, VITS Engineering College Satna (MP), India Abstract Scheduling is a fundamental
More informationCentralized Systems. A Centralized Computer System. Chapter 18: Database System Architectures
Chapter 18: Database System Architectures Centralized Systems! Centralized Systems! Client--Server Systems! Parallel Systems! Distributed Systems! Network Types! Run on a single computer system and do
More informationAbstract. 1. Introduction
A REVIEW-LOAD BALANCING OF WEB SERVER SYSTEM USING SERVICE QUEUE LENGTH Brajendra Kumar, M.Tech (Scholor) LNCT,Bhopal 1; Dr. Vineet Richhariya, HOD(CSE)LNCT Bhopal 2 Abstract In this paper, we describe
More informationHow To Compare Load Sharing And Job Scheduling In A Network Of Workstations
A COMPARISON OF LOAD SHARING AND JOB SCHEDULING IN A NETWORK OF WORKSTATIONS HELEN D. KARATZA Department of Informatics Aristotle University of Thessaloniki 546 Thessaloniki, GREECE Email: karatza@csd.auth.gr
More informationA Load Balancing Model Based on Cloud Partitioning for the Public Cloud
IEEE TRANSACTIONS ON CLOUD COMPUTING YEAR 2013 A Load Balancing Model Based on Cloud Partitioning for the Public Cloud Gaochao Xu, Junjie Pang, and Xiaodong Fu Abstract: Load balancing in the cloud computing
More informationPerformance Analysis of VM Scheduling Algorithm of CloudSim in Cloud Computing
IJECT Vo l. 6, Is s u e 1, Sp l-1 Ja n - Ma r c h 2015 ISSN : 2230-7109 (Online) ISSN : 2230-9543 (Print) Performance Analysis Scheduling Algorithm CloudSim in Cloud Computing 1 Md. Ashifuddin Mondal,
More informationhttp://www.paper.edu.cn
5 10 15 20 25 30 35 A platform for massive railway information data storage # SHAN Xu 1, WANG Genying 1, LIU Lin 2** (1. Key Laboratory of Communication and Information Systems, Beijing Municipal Commission
More informationA Survey on Load Balancing Algorithms in Cloud Environment
A Survey on Load s in Cloud Environment M.Aruna Assistant Professor (Sr.G)/CSE Erode Sengunthar Engineering College, Thudupathi, Erode, India D.Bhanu, Ph.D Associate Professor Sri Krishna College of Engineering
More informationA Novel Switch Mechanism for Load Balancing in Public Cloud
International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) A Novel Switch Mechanism for Load Balancing in Public Cloud Kalathoti Rambabu 1, M. Chandra Sekhar 2 1 M. Tech (CSE), MVR College
More informationA STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti 2, Nidhi Rajak 3
A STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti, Nidhi Rajak 1 Department of Computer Science & Applications, Dr.H.S.Gour Central University, Sagar, India, ranjit.jnu@gmail.com
More informationA Novel Load-Balancing Algorithm for Distributed Systems
A Novel Load-Balancing Algorithm for Distributed Systems Parvati Rajendran School of Computing Science and Engineering, VIT University, Vellore, India Shalinee Singh School of Computing Science and Engineering,
More informationImproved Dynamic Load Balance Model on Gametheory for the Public Cloud
ISSN (Online): 2349-7084 GLOBAL IMPACT FACTOR 0.238 DIIF 0.876 Improved Dynamic Load Balance Model on Gametheory for the Public Cloud 1 Rayapu Swathi, 2 N.Parashuram, 3 Dr S.Prem Kumar 1 (M.Tech), CSE,
More informationThe Load Balancing Strategy to Improve the Efficiency in the Public Cloud Environment
The Load Balancing Strategy to Improve the Efficiency in the Public Cloud Environment Majjaru Chandra Babu Assistant Professor, Priyadarsini College of Engineering, Nellore. Abstract: Load balancing in
More informationResource Cost Optimization for Dynamic Load Balancing on Web Server System
Article can be accessed online at http://www.publishingindia.com Resource Cost Optimization for Dynamic Load Balancing on Web Server System Harikesh Singh*, Shishir Kumar** Abstract The growth of technology
More informationKeywords: Cloudsim, MIPS, Gridlet, Virtual machine, Data center, Simulation, SaaS, PaaS, IaaS, VM. Introduction
Vol. 3 Issue 1, January-2014, pp: (1-5), Impact Factor: 1.252, Available online at: www.erpublications.com Performance evaluation of cloud application with constant data center configuration and variable
More informationAn Ontology-Based Approach for Optimal Resource Allocation in Vehicular Cloud Computing
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 2, February 2015,
More informationA SURVEY ON LOAD BALANCING ALGORITHMS FOR CLOUD COMPUTING
A SURVEY ON LOAD BALANCING ALGORITHMS FOR CLOUD COMPUTING Avtar Singh #1,Kamlesh Dutta #2, Himanshu Gupta #3 #1 Department of Computer Science and Engineering, Shoolini University, avtarz@gmail.com #2
More informationA Comparison of Dynamic Load Balancing Algorithms
A Comparison of Dynamic Load Balancing Algorithms Toufik Taibi 1, Abdelouahab Abid 2 and Engku Fariez Engku Azahan 2 1 College of Information Technology, United Arab Emirates University, P.O. Box 17555,
More informationAN EFFICIENT LOAD BALANCING APPROACH IN CLOUD SERVER USING ANT COLONY OPTIMIZATION
AN EFFICIENT LOAD BALANCING APPROACH IN CLOUD SERVER USING ANT COLONY OPTIMIZATION Shanmuga Priya.J 1, Sridevi.A 2 1 PG Scholar, Department of Information Technology, J.J College of Engineering and Technology
More informationAnalysis of Job Scheduling Algorithms in Cloud Computing
Analysis of Job Scheduling s in Cloud Computing Rajveer Kaur 1, Supriya Kinger 2 1 Research Fellow, Department of Computer Science and Engineering, SGGSWU, Fatehgarh Sahib, India, Punjab (140406) 2 Asst.Professor,
More informationA Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing
A Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing Liang-Teh Lee, Kang-Yuan Liu, Hui-Yang Huang and Chia-Ying Tseng Department of Computer Science and Engineering,
More informationEfficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration
Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration 1 Harish H G, 2 Dr. R Girisha 1 PG Student, 2 Professor, Department of CSE, PESCE Mandya (An Autonomous Institution under
More informationStatistics Analysis for Cloud Partitioning using Load Balancing Model in Public Cloud
Statistics Analysis for Cloud Partitioning using Load Balancing Model in Public Cloud 1 V.DIVYASRI, M.Tech (CSE) GKCE, SULLURPETA, v.sridivya91@gmail.com 2 T.SUJILATHA, M.Tech CSE, ASSOCIATE PROFESSOR
More informationThe Key Technology Research of Virtual Laboratory based On Cloud Computing Ling Zhang
International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) The Key Technology Research of Virtual Laboratory based On Cloud Computing Ling Zhang Nanjing Communications
More informationStudy on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm
www.ijcsi.org 54 Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm Linan Zhu 1, Qingshui Li 2, and Lingna He 3 1 College of Mechanical Engineering, Zhejiang
More informationService Oriented Distributed Manager for Grid System
Service Oriented Distributed Manager for Grid System Entisar S. Alkayal Faculty of Computing and Information Technology King Abdul Aziz University Jeddah, Saudi Arabia entisar_alkayal@hotmail.com Abstract
More informationGrid Scheduling Dictionary of Terms and Keywords
Grid Scheduling Dictionary Working Group M. Roehrig, Sandia National Laboratories W. Ziegler, Fraunhofer-Institute for Algorithms and Scientific Computing Document: Category: Informational June 2002 Status
More informationA SURVEY ON LOAD BALANCING ALGORITHMS IN CLOUD COMPUTING
A SURVEY ON LOAD BALANCING ALGORITHMS IN CLOUD COMPUTING Harshada Raut 1, Kumud Wasnik 2 1 M.Tech. Student, Dept. of Computer Science and Tech., UMIT, S.N.D.T. Women s University, (India) 2 Professor,
More informationGroup Based Load Balancing Algorithm in Cloud Computing Virtualization
Group Based Load Balancing Algorithm in Cloud Computing Virtualization Rishi Bhardwaj, 2 Sangeeta Mittal, Student, 2 Assistant Professor, Department of Computer Science, Jaypee Institute of Information
More informationModels of Load Balancing Algorithm in Cloud Computing
Models of Load Balancing Algorithm in Cloud Computing L. Aruna 1, Dr. M. Aramudhan 2 1 Research Scholar, Department of Comp.Sci., Periyar University, Salem. 2 Associate Professor & Head, Department of
More informationDYNAMIC LOAD BALANCING IN A DECENTRALISED DISTRIBUTED SYSTEM
DYNAMIC LOAD BALANCING IN A DECENTRALISED DISTRIBUTED SYSTEM 1 Introduction In parallel distributed computing system, due to the lightly loaded and overloaded nodes that cause load imbalance, could affect
More informationA Game Theoretic Approach for Cloud Computing Infrastructure to Improve the Performance
P.Bhanuchand and N. Kesava Rao 1 A Game Theoretic Approach for Cloud Computing Infrastructure to Improve the Performance P.Bhanuchand, PG Student [M.Tech, CS], Dep. of CSE, Narayana Engineering College,
More informationANALYSIS OF WORKFLOW SCHEDULING PROCESS USING ENHANCED SUPERIOR ELEMENT MULTITUDE OPTIMIZATION IN CLOUD
ANALYSIS OF WORKFLOW SCHEDULING PROCESS USING ENHANCED SUPERIOR ELEMENT MULTITUDE OPTIMIZATION IN CLOUD Mrs. D.PONNISELVI, M.Sc., M.Phil., 1 E.SEETHA, 2 ASSISTANT PROFESSOR, M.PHIL FULL-TIME RESEARCH SCHOLAR,
More informationA Comparative Study of Load Balancing Algorithms in Cloud Computing
A Comparative Study of Load Balancing Algorithms in Cloud Computing Reena Panwar M.Tech CSE Scholar Department of CSE, Galgotias College of Engineering and Technology, Greater Noida, India Bhawna Mallick,
More informationACO Based Dynamic Resource Scheduling for Improving Cloud Performance
ACO Based Dynamic Resource Scheduling for Improving Cloud Performance Priyanka Mod 1, Prof. Mayank Bhatt 2 Computer Science Engineering Rishiraj Institute of Technology 1 Computer Science Engineering Rishiraj
More informationA novel load balancing algorithm for computational grid
International Journal of Computational Intelligence Techniques, ISSN: 0976 0466 & E-ISSN: 0976 0474 Volume 1, Issue 1, 2010, PP-20-26 A novel load balancing algorithm for computational grid Saravanakumar
More informationEfficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing
Efficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing Hilda Lawrance* Post Graduate Scholar Department of Information Technology, Karunya University Coimbatore, Tamilnadu, India
More informationReallocation and Allocation of Virtual Machines in Cloud Computing Manan D. Shah a, *, Harshad B. Prajapati b
Proceedings of International Conference on Emerging Research in Computing, Information, Communication and Applications (ERCICA-14) Reallocation and Allocation of Virtual Machines in Cloud Computing Manan
More informationDynamic resource management for energy saving in the cloud computing environment
Dynamic resource management for energy saving in the cloud computing environment Liang-Teh Lee, Kang-Yuan Liu, and Hui-Yang Huang Department of Computer Science and Engineering, Tatung University, Taiwan
More informationHeterogeneous Workload Consolidation for Efficient Management of Data Centers in Cloud Computing
Heterogeneous Workload Consolidation for Efficient Management of Data Centers in Cloud Computing Deep Mann ME (Software Engineering) Computer Science and Engineering Department Thapar University Patiala-147004
More informationVarious Schemes of Load Balancing in Distributed Systems- A Review
741 Various Schemes of Load Balancing in Distributed Systems- A Review Monika Kushwaha Pranveer Singh Institute of Technology Kanpur, U.P. (208020) U.P.T.U., Lucknow Saurabh Gupta Pranveer Singh Institute
More informationHYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS
HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS R. Angel Preethima 1, Margret Johnson 2 1 Student, Computer Science and Engineering, Karunya
More informationCreation and Allocation of Virtual Machines for Execution of Cloudlets in Cloud Environment
Creation and Allocation of Virtual Machines for Execution of Cloudlets in Cloud Environment Bachelor of Technology In Computer Science & Engineering By Durbar Show 110CS0153 Department of Computer Science
More informationRoad Map. Scheduling. Types of Scheduling. Scheduling. CPU Scheduling. Job Scheduling. Dickinson College Computer Science 354 Spring 2010.
Road Map Scheduling Dickinson College Computer Science 354 Spring 2010 Past: What an OS is, why we have them, what they do. Base hardware and support for operating systems Process Management Threads Present:
More informationENERGY-EFFICIENT TASK SCHEDULING ALGORITHMS FOR CLOUD DATA CENTERS
ENERGY-EFFICIENT TASK SCHEDULING ALGORITHMS FOR CLOUD DATA CENTERS T. Jenifer Nirubah 1, Rose Rani John 2 1 Post-Graduate Student, Department of Computer Science and Engineering, Karunya University, Tamil
More information