Abstract
Deterministic dynamic nonlinear time-delay systems are developed to model load balancing in a cluster of computer nodes used for parallel computations. The model is shown to be self consistent in that the queue lengths cannot go negative and the total number of tasks in all the queues are conserved (i.e., load balancing can neither create nor lose tasks). Further, it is shown that using the proposed load balancing algorithms, the system is stable. Experimental results are presented and compared with the predicted results from the analytical model. In particular, simulations of the models are compared with an experimental implementation of the load balancing algorithm on a parallel computer network.
| Original language | English |
|---|---|
| Pages (from-to) | 582-587 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 1 |
| State | Published - 2003 |
| Event | 42nd IEEE Conference on Decision and Control - Maui, HI, United States Duration: 9 Dec 2003 → 12 Dec 2003 |
Keywords
- Computer Networks
- Load balancing
- Time Delay Systems