First and second order diffusive methods for rapid, coarse, distributed load balancing

Bhaskar Ghosh, S. Muthukrishnan, Martin H. Schultz

    Research output: Contribution to conferencePaper

    Abstract

    The problem of modeling load balancing is considered in a variety of distributed settings. A new direction in diffusive schedules was introduced by considering schedules that are modeled as: w1 = Mw0; wt+1 = βMwt+(1-β)wt-1 for some appropriate β, called the second order schedules. In the idealized setting of weights being real numbers, results indicate that β can be chosen because the second order schedule is significantly faster than the first order method. Consequently, an algorithm that performs coarse load balancing rapidly and can be used in a number of applications is produced.

    Original languageEnglish (US)
    Pages72-81
    Number of pages10
    StatePublished - Dec 1 1996
    EventProceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy
    Duration: Jun 24 1996Jun 26 1996

    Other

    OtherProceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures
    CityPadua, Italy
    Period6/24/966/26/96

      Fingerprint

    ASJC Scopus subject areas

    • Software
    • Safety, Risk, Reliability and Quality

    Cite this

    Ghosh, B., Muthukrishnan, S., & Schultz, M. H. (1996). First and second order diffusive methods for rapid, coarse, distributed load balancing. 72-81. Paper presented at Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures, Padua, Italy, .