The relative performance of scalable load balancing algorithms in loosely-coupled distributed systems. Available in 2 volumes.

  • Rupert A. Simpson

    Student thesis: Doctoral ThesisDoctor of Philosophy


    The computer systems of today are characterised by data and program control that are distributed functionally and geographically across a network. A major issue of concern in this environment is the operating system activity of resource management for different processors in the network. To ensure equity in load distribution and improved system performance, load balancing is often undertaken.
    The research conducted in this field so far, has been primarily concerned with a small set of algorithms operating on tightly-coupled distributed systems. More recent studies have investigated the performance of such algorithms in loosely-coupled architectures but using a small set of processors.
    This thesis describes a simulation model developed to study the behaviour and general performance characteristics of a range of dynamic load balancing algorithms. Further, the scalability of these algorithms are discussed and a range of regionalised load balancing algorithms developed. In particular, we examine the impact of network diameter and delay on the performance of such algorithms across a range of system workloads. The results produced seem to suggest that the performance of simple dynamic policies are scalable but lack the load stability of more complex global average algorithms.
    Date of AwardJul 1994
    Original languageEnglish
    SupervisorAlan Harget (Supervisor)


    • distributed resource scheduling
    • load balancing protocols

    Cite this