A Novel Classification of Load Balancing Algorithms in Distributed Systems

2012 ◽  
pp. 313-320
Author(s):  
Mohammad Reza Keyvanpour ◽  
Hadi Mansourifar ◽  
Behzad Bagherzade
Keyword(s):  
Distributed Systems ◽  
Load Balancing

Load Balancıng Technique in Distributed Systems: A Review

2021 ◽  
Author(s):  
Santosh T. Waghmode ◽  
Bankat M. Patil
Keyword(s):  
Distributed Systems ◽  
Load Balancing

A generic API for load balancing in distributed systems for big data management

2015 ◽  
Vol 28 (8) ◽  
pp. 2440-2456 ◽  
Author(s):  
Maeva Antoine ◽  
Laurent Pellegrino ◽  
Fabrice Huet ◽  
Françoise Baude
Keyword(s):  
Big Data ◽  
Distributed Systems ◽  
Load Balancing ◽  
Data Management

Distributed Systems

2020 ◽  
pp. 143-198
Author(s):  
Andreas Bolfing
Keyword(s):  
Distributed Systems ◽  
Fault Tolerant ◽  
Deterministic Algorithm ◽  
Impossibility Result ◽  
Software Systems ◽  
Trade Off ◽  
Byzantine Failures ◽  
The Individual ◽  
Special Case

Chapter 5 considers distributed systems by their properties. The first section studies the classification of software systems, which is usually distinguished in centralized, decentralized and distributed systems. It studies the differences between these three major approaches, showing there is a rather multidimensional classification instead of a linear one. The most important case are distributed systems that enable spreading of computational tasks across several autonomous, independently acting computational entities. A very important result of this case is the CAP theorem that considers the trade-off between consistency, availability and partition tolerance. The last section deals with the possibility to reach consensus in distributed systems, discussing how fault tolerant consensus mechanisms enable mutual agreement among the individual entities in presence of failures. One very special case are so-called Byzantine failures that are discussed in great detail. The main result is the so-called FLP Impossibility Result which states that there is no deterministic algorithm that guarantees solution to the consensus problem in the asynchronous case. The chapter concludes by considering practical solutions that circumvent the impossibility result in order to reach consensus.

Sign in / Sign up

Export Citation Format

Share Document