Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Load sharing in soft real-time distributed computer systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Dynamic Transaction Routing in Distributed Database Systems
IEEE Transactions on Software Engineering
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
A semi distributed task allocation strategy for large hypercube supercomputers
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Performance prediction of distributed load balancing on multicomputer systems
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
A model for job scheduling in a distributed computer network
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Fault-tolerant task management and load re-distribution on massively parallel hypercube systems
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Evaluation of load sharing in HARTS while considering message routing and broadcasting
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Evaluation of Load Sharing in HARTS with Consideration of Its Communication Activities
IEEE Transactions on Parallel and Distributed Systems
Load Sharing in Hypercube-Connected Multicomputers in the Presence of Node Failures
IEEE Transactions on Computers
Load balancing to adjust for proximity in some network topologies
Parallel Computing
IEEE Transactions on Computers
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems
IEEE Transactions on Parallel and Distributed Systems
Power conservation strategy for mobile computers using load sharing
ACM SIGMOBILE Mobile Computing and Communications Review
Incorporation of Optimal Timeouts into Distributed Real-Time Load Sharing
IEEE Transactions on Computers
IEEE Transactions on Computers
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers
IEEE Transactions on Computers
A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks
IEEE Transactions on Computers
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Integrated scheduling of tasks and messages in distributed real-time systems
Engineering of distributed control systems
Efficient processing of client transactions in real-time
Distributed and Parallel Databases
A multi-dimensional scheduling scheme in a Grid computing environment
Journal of Parallel and Distributed Computing
Zone-based congestion detection and control using routing method on the internet
International Journal of High Performance Computing and Networking
Research: Scalable approaches to load sharing in the presence of multicasting
Computer Communications
| Hi-index | 15.00 |
A decentralized, dynamic load sharing (LS) method based on state-change broadcasts is proposed for a distributed real-time system. Whenever the state of a node changes from underloaded to fully loaded and vice versa, the node broadcasts this change to a set of nodes, called a buddy set, in the system. The performance of the method is evaluated with both analytic modeling and simulation. It is modeled first by an embedded Markov chain for which numerical solutions are derived. The model solutions are then used to calculate the distribution of queue lengths at the nodes and the probability of meeting tasks deadlines. The analytical results show that buddy sets of ten nodes outperform those of less than ten nodes, and the incremental benefit gained from increasing the buddy set size beyond 15 nodes is insignificant. These and other analytical results are verified by simulation. The proposed LS method is shown to meet task deadlines with a very high probability.