scholarly journals Scalable load balancing in the presence of heterogeneous servers

2021 ◽  
Vol 145 ◽  
pp. 102151 ◽  
Author(s):  
Kristen Gardner ◽  
Jazeem Abdul Jaleel ◽  
Alexander Wickeham ◽  
Sherwin Doroudi
2021 ◽  
Vol 48 (3) ◽  
pp. 37-38
Author(s):  
Kristen Gardner ◽  
Jazeem Abdul Jaleel ◽  
Alexander Wickeham ◽  
Sherwin Doroudi

In large-scale computer systems, deciding how to dispatch arriving jobs to servers is a primary factor affecting system performance. Consequently, there is a wealth of literature on designing, analyzing, and evaluating the performance of load balancing policies. For analytical tractability, most existing work on dispatching in large-scale systems makes a key assumption: that the servers are homogeneous, meaning that they all have the same speeds, capabilities, and available resources. But this assumption is not accurate in practice. Modern computer systems are instead heterogeneous: server farms may consist of multiple generations of hardware, servers with varied resources, or even virtual machines running in a cloud environment. Given the ubiquity of heterogeneity in today's systems, it is critically important to develop load balancing policies that perform well in heterogeneous environments. In this paper, we focus on systems in which server speeds are heterogeneous.


Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.


2003 ◽  
Vol 123 (10) ◽  
pp. 1847-1857
Author(s):  
Takahiro Tsukishima ◽  
Masahiro Sato ◽  
Hisashi Onari
Keyword(s):  

2014 ◽  
Vol 134 (8) ◽  
pp. 1104-1113
Author(s):  
Shinji Kitagami ◽  
Yosuke Kaneko ◽  
Hidetoshi Kambe ◽  
Shigeki Nankaku ◽  
Takuo Suganuma
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document