• DocumentCode
    3639582
  • Title

    A hierarchical load sharing policy for distributed systems

  • Author

    S.P. Dandamudi;K.C.M. Lo

  • Author_Institution
    Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada
  • fYear
    1997
  • Firstpage
    3
  • Lastpage
    10
  • Abstract
    In dynamic load sharing policies, system state information can be collected in a distributed manner or by a single coordinator node. Two principal policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. Distributed policies do not perform as well as the centralized policy. The performance of distributed policies is sensitive to the variance in job service times and inter-arrival times. Distributed policies, however, are scalable, whereas the centralized policy can cause bottlenecks and fault-tolerance problems for large systems. We propose a hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages.
  • Keywords
    "Computer science","Fault tolerant systems","Telecommunications","Fault tolerance","Sampling methods"
  • Publisher
    ieee
  • Conference_Titel
    Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1997. MASCOTS ´97., Proceedings Fifth International Symposium on
  • Print_ISBN
    0-8186-7758-9
  • Type

    conf

  • DOI
    10.1109/MASCOT.1997.567572
  • Filename
    567572