Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Analysis of join-the-shortest-queue routing for web server farms
Performance Evaluation
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Randomized load balancing with general service time distributions
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Pull versus push mechanism in large distributed networks: closed form results
Proceedings of the 24th International Teletraffic Congress
Distributed oblivious load balancing using prioritized job replication
Proceedings of the 8th International Conference on Network and Service Management
Hi-index | 0.00 |
The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balancers is highly desirable. Existing algorithms with a centralized design, such as Join-the-Shortest-Queue (JSQ), incur high communication overhead for distributed dispatchers. We propose a novel class of algorithms called Join-Idle-Queue (JIQ) for distributed load balancing in large systems. Unlike algorithms such as Power-of-Two, the JIQ algorithm incurs no communication overhead between the dispatchers and processors at job arrivals. We analyze the JIQ algorithm in the large system limit and find that it effectively results in a reduced system load, which produces 30-fold reduction in queueing overhead compared to Power-of-Two at medium to high load. An extension of the basic JIQ algorithm deals with very high loads using only local information of server load.