Filters








135,862 Hits in 4.8 sec

Randomized load balancing with general service time distributions

Maury Bramson, Yi Lu, Balaji Prabhakar
2010 Performance Evaluation Review  
This paper describes a modularized program for treating randomized load balancing problems with general service time distributions and service disciplines.  ...  It is desirable to study load balancing models with more general, especially heavy-tailed, service time distributions since such service times occur widely in practice.  ...  The main contribution of the paper is a framework for analyzing randomized load balancing systems with general service times and service disciplines.  ... 
doi:10.1145/1811099.1811071 fatcat:rjmxgoxycfghjohualcowwvuou

Randomized load balancing with general service time distributions

Maury Bramson, Yi Lu, Balaji Prabhakar
2010 Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '10  
This paper describes a modularized program for treating randomized load balancing problems with general service time distributions and service disciplines.  ...  It is desirable to study load balancing models with more general, especially heavy-tailed, service time distributions since such service times occur widely in practice.  ...  The main contribution of the paper is a framework for analyzing randomized load balancing systems with general service times and service disciplines.  ... 
doi:10.1145/1811039.1811071 dblp:conf/sigmetrics/BramsonLP10 fatcat:ynros6zfw5bl3jvl43s5l24t4y

Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services

Yi Lu, Qiaomin Xie, Gabriel Kliot, Alan Geller, James R. Larus, Albert Greenberg
2011 Performance evaluation (Print)  
We propose a novel class of algorithms called Join-Idle-Queue (JIQ) for distributed load balancing in large systems.  ...  Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balancers is highly desirable.  ...  We compute q s for exponential service time distributions and general service discipline, q s = s 1 − s . (5) Eqn. (5) also holds for PS service discipline and general service time distributions in the  ... 
doi:10.1016/j.peva.2011.07.015 fatcat:xvmsjdbdkzdnhiedmktgpx2be4

A new fuzzy-decision based load balancing system for distributed object computing

Yu-Kwong Kwok, Lap-Sun Cheung
2004 Journal of Parallel and Distributed Computing  
However, as the system scales up (e.g., with larger number of server and client objects, and more machines), a judicious load balancing system is required to efficiently distribute the workload (e.g.,  ...  Unfortunately, in existing distributed object middleware systems, such a load balancing facility does not exist.  ...  The average client response time of random load balancing algorithm is the highest in all the cases because uneven distribution of load exists in the random load balancing algorithm.  ... 
doi:10.1016/j.jpdc.2003.11.002 fatcat:p5iyuojctbhgldixfkb5gncigu

A Survey Report on Distributed System Using Load Balancing Approach

Arju Malik, PankajPratap Singh
2016 IOSR Journal of Computer Engineering  
Load balancing is the process of distributed the load among various nodes of a distributed system to improve both job response time and resource utilization while also avoiding a situation where some of  ...  Load balancing involves assigning tasks to each processor and minimizing the execution time of the program.  ...  Since load balancing requires multiple servers, it is usually combined with failover and backup services.  ... 
doi:10.9790/0661-180405153158 fatcat:ptbccwenf5cpzpk37twleypswy

The Effect of Queuing System Capacity on the Blocking Probability Value Using M/G/1/C and G/G/m/K Model in Cloud Data Center

Yuniarmelinda Ikha Meru B., Sholeh Hadi Pramono, Erni Yudaningtyas
2020 International Journal of Computer Applications Technology and Research  
The queuing model used to analyze is M/G/1/C on load balancing and G/G/m/K on physical machine. General distribution queuing model compatible with the dynamic characteristics of cloud computing.  ...  Because load balancing divides the task load equally into each physical machine.  ...  Service time distribution on load balancing and physical machines used general distribution.  ... 
doi:10.7753/ijcatr0908.1001 fatcat:gcv7lr5tlfd3dfiyq5eyg3hjom

Cluster load balancing for fine-grain network services

Kai Shen, Tao Yang, Lingkun Chu
2002 Proceedings 16th International Parallel and Distributed Processing Symposium  
Our study concludes that: 1) Random polling based loadbalancing policies are well-suited for fine-grain network services; 2) A small poll size provides sufficient information for load balancing, while  ...  Load balancing on a cluster of machines has been studied extensively in the literature, mainly focusing on coarse-grain distributed computation.  ...  Load balancing techniques in these studies are valuable in general, but not all of them can be applied for cluster-based network services.  ... 
doi:10.1109/ipdps.2002.1015534 dblp:conf/ipps/ShenYC02 fatcat:xu5zu3p2t5agtdicad77t7ofhu

Analysing the Impact of Heterogeneity with Greedy Resource Allocation Algorithms for Dynamic Load Balancing in Heterogeneous Distributed Computing System

Bibhudatta Sahoo, Dillip Kumar, Sanjay Kumar Jena
2013 International Journal of Computer Applications  
The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node).  ...  Heterogeneous Distributed systems have been an active research area in computer science for the last two decade, task allocation and load balancing have been a major issue associated with such systems.  ...  Assume that service time follow exponential distribution with service rate so that  1 >  2 > …  m , where  I is the service rate of node M i .  ... 
doi:10.5120/10190-5070 fatcat:sowjzfjvuvf7rpyicuzfgvk5r4

Load Balancing in Distributed Parallel Systems for Telecommunications

V. Sinkovic, I. Lovrek, G. Németh
1999 Computing  
Communication networks pose difficult problems for the soft limit real-time control of calls and services.  ...  Based upon the simulation results, new load balancing algorithms are developed for the respective problem class.  ...  Random request generation (request interarrival time: exponential distribution, number of requests: Poisson distribution); 2b.  ... 
doi:10.1007/s006070050031 fatcat:ukgof5ltl5hgth74t2kdhjnjoa

Integrating Trading and Load Balancing for Efficient Management of Services in Distributed Systems [chapter]

Dirk Thißen, Helmut Neukirchen
2000 Lecture Notes in Computer Science  
This paper deals with the integration of a trader and a load balancer.  ...  Focussing on the service level, examples for existing concepts are trading, to find services in a distributed environment, and load balancing, to avoid performance bottlenecks in service provision.  ...  To approximate a real scenario, a request sequence was generated by using a random number generator to place requests in a given interval.  ... 
doi:10.1007/10722515_5 fatcat:lkmah2tmsfbpbcovjjixgkee7u

Cloud Computing based on the Load Balancing Algorithm

NV Abhinav Chand, A Hemanth Kumar, Surya Teja Marella
2018 International Journal of Engineering & Technology  
Cloud computing provides services to clients through the internet. Cloud computing enables easy access to resources distributed all over the world.  ...  If load balancing is performed efficiently, it improves QoS metric including cost, throughput, response time, resource utilization and performance.  ...  In distributed dynamic load balancing, all nodes interact with one another and distribute tasks among nodes.  ... 
doi:10.14419/ijet.v7i4.7.20528 fatcat:hktsbq5smnf7fbc42ubfio6eui

Comparative Study of Load Balancing Algorithms

Jyoti Vashistha
2013 IOSR Journal of Engineering  
Load balancing is a key issue in these type of large scale situation. Load balancing is to achieve optimal resources, maximize throughput, minimize response time and avoid the overload.  ...  Load balancing ensures that all the processor in the system or every node in the network does approximately the equal amount of work at any instant of time.  ...  The slave processors are chosen randomly following random numbers generated based on a statistic distribution.  ... 
doi:10.9790/3021-03324550 fatcat:byk7alveyreajgspaub2obtrra

Network Load Balancing Methods: Experimental Comparisons and Improvement [article]

Shafinaz Islam
2017 arXiv   pre-print
In this paper, we study and evaluate four load balancing methods: random, round robin, shortest queue, and shortest queue with stale load information.  ...  We build a simulation model and compare mean delay of the systems for the load balancing methods. We also provide a method to improve shortest queue with stale load information load balancing.  ...  Jobs arrive according to a Poisson process with the rate equals to . Service times are independent and exponentially distributed with a mean 1.0 second.  ... 
arXiv:1710.06957v1 fatcat:grsikafunreaflve7uhd7pqycu

RAS: Request Assignment Simulator for Cloud-Based Applications

2015 KSII Transactions on Internet and Information Systems  
Applications deployed in cloud receive a huge volume of requests from geographically distributed users whose satisfaction with the cloud service is directly proportional to the efficiency with which the  ...  It is a customizable, visual tool that simulates the request assignment process based on load balancing principles with a set of parameters that impact resource utilization.  ...  Each request is generated with random process time. Requests are queued based on a first-come, first-served principle.  ... 
doi:10.3837/tiis.2015.06.004 fatcat:w4uosqz4i5ggpdjyfz3owngnn4

On Load Balancing in Distributed Telecommunication Systems [chapter]

Per-Oddvar Osland, Peder J. Emstad
2000 IFIP Advances in Information and Communication Technology  
Distributed systems providing telecommunication services, such as IN and TINA, must satisfy strict real-time requirements.  ...  Load control and load balancing are two closely connected policies that may be applied to achieve low rejection probability for new calls, maintained response times for accepted calls, and balanced load  ...  The following inequalities may be used when comparing with the no balancing and random policies: P(S> slimit I LB) P(S> slimit I no balancing) Tl and P(S> slimit I LB) ( I""t ) < T2 P S > s I random -  ... 
doi:10.1007/978-0-387-35581-8_28 fatcat:net2fosqvvco5edxj4y77xxgzu
« Previous Showing results 1 — 15 out of 135,862 results