The effect of time delays on the stability of load balancing algorithms for parallel computations

Electr. & Comput. Eng. Dept., Univ. of Tennessee, Knoxville, TN, USA
IEEE Transactions on Control Systems Technology (Impact Factor: 2.52). 12/2005; DOI: 10.1109/TCST.2005.854339
Source: IEEE Xplore

ABSTRACT A deterministic dynamic nonlinear time-delay system is 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 and the network 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 in the sense of Lyapunov. 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 distributed computing network.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Models of discrete event systems combine ideas from control theory and computer science to represent the evolution of distributed processes. We formalize a notion of the invalidation of models presumed to describe dynamics on networks, and introduce an algorithm to evaluate a class of event-driven processes that evolve close to an invariant and stable state. The algorithm returns the value true, if according to the proposed notion of invalidation, the evolution of empirical observations is inconsistent with the stability properties of the model. To illustrate the approach, we represent a generic decision-making process in which the marginal utility of allocating agents to particular nodes rests on the well-known concept in economy theory of the law of diminishing returns.
    American Control Conference (ACC), 2013; 06/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Given the increasing prevalence of compute/data intensive applications, the explosive growth in data, and the emergence of cloud computing, there is an urgent need for effective approaches to support such applications in non-dedicated heterogeneous distributed environments. This paper proposes an efficient technique for handling parallel tasks, while dynamically maintaining load balancing. Such tasks include concurrently downloading files from replicated sources; simultaneously using multiple network interfaces for message transfers; and executing parallel computations on independent distributed processors. This technique, DDOps, (Dual Direction Operations) enables efficient utilization of available resources in a parallel/distributed environment without imposing any significant control overhead. The idea is based on the notion of producer pairs that perform tasks in parallel from opposite directions and the consumers that distribute and control the work and receive and combine the results. Most dynamic load balancing approaches require prior knowledge and/or constant monitoring at run time. In DDOps, load balancing does not require prior knowledge or run-time monitoring. Rather, load balancing is automatically inherent as the tasks are handled from the opposite directions, allowing the processing to continue until the producers meet indicating the completion of all tasks at the same time. Thus DDOps is most suitable for heterogeneous environments where resources vary in specifications, locations, and operating conditions. In addition, since DDOps does not require producers to communicate at all, the network effect is minimized.
    Cluster Computing 06/2013; 17(2):503-528. DOI:10.1007/s10586-013-0294-3 · 0.95 Impact Factor
  • Source
    American Control Conference, Washington DC, USA; 06/2012

Full-text (2 Sources)

Available from
Jun 1, 2014