Adversarial model for distributed dynamic load balancing

Shanmugavelayutham Muthukrishnan, R. Rajaraman

    Research output: Contribution to conferencePaper

    Abstract

    We study the problem of balancing the load on processors of an arbitrary network. If jobs arrive or depart during the process of load balancing, we have the dynamic load balancing problem; otherwise, we have the static load balancing problem. While static load balancing on arbitrary and special networks has been well studied, very little is known about dynamic load balancing. The difficulty lies in modeling the arrivals and departures of jobs in a clean manner. In this paper, we initiate the study of dynamic load balancing by modeling job traffic using an adversary. Our main result is that a simple, local control distributed load balancing algorithm maintains the load of the network within a stable level against this powerful adversary. Our results hold for different models of traffic patterns and processor communication.

    Original languageEnglish (US)
    Pages47-54
    Number of pages8
    StatePublished - Jan 1 1998
    EventProceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA - Puerto Vallarta, Mexico
    Duration: Jun 28 1998Jul 2 1998

    Conference

    ConferenceProceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA
    CityPuerto Vallarta, Mexico
    Period6/28/987/2/98

    Fingerprint

    Dynamic loads
    Resource allocation
    Communication

    ASJC Scopus subject areas

    • Software
    • Safety, Risk, Reliability and Quality

    Cite this

    Muthukrishnan, S., & Rajaraman, R. (1998). Adversarial model for distributed dynamic load balancing. 47-54. Paper presented at Proceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, Puerto Vallarta, Mexico, .

    Adversarial model for distributed dynamic load balancing. / Muthukrishnan, Shanmugavelayutham; Rajaraman, R.

    1998. 47-54 Paper presented at Proceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, Puerto Vallarta, Mexico, .

    Research output: Contribution to conferencePaper

    Muthukrishnan, S & Rajaraman, R 1998, 'Adversarial model for distributed dynamic load balancing' Paper presented at Proceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, Puerto Vallarta, Mexico, 6/28/98 - 7/2/98, pp. 47-54.
    Muthukrishnan S, Rajaraman R. Adversarial model for distributed dynamic load balancing. 1998. Paper presented at Proceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, Puerto Vallarta, Mexico, .
    Muthukrishnan, Shanmugavelayutham ; Rajaraman, R. / Adversarial model for distributed dynamic load balancing. Paper presented at Proceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, Puerto Vallarta, Mexico, .8 p.
    @conference{0a4e77b3a08f4d9d8931e4028b1fb9bc,
    title = "Adversarial model for distributed dynamic load balancing",
    abstract = "We study the problem of balancing the load on processors of an arbitrary network. If jobs arrive or depart during the process of load balancing, we have the dynamic load balancing problem; otherwise, we have the static load balancing problem. While static load balancing on arbitrary and special networks has been well studied, very little is known about dynamic load balancing. The difficulty lies in modeling the arrivals and departures of jobs in a clean manner. In this paper, we initiate the study of dynamic load balancing by modeling job traffic using an adversary. Our main result is that a simple, local control distributed load balancing algorithm maintains the load of the network within a stable level against this powerful adversary. Our results hold for different models of traffic patterns and processor communication.",
    author = "Shanmugavelayutham Muthukrishnan and R. Rajaraman",
    year = "1998",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "47--54",
    note = "Proceedings of the 1998 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA ; Conference date: 28-06-1998 Through 02-07-1998",

    }

    TY - CONF

    T1 - Adversarial model for distributed dynamic load balancing

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Rajaraman, R.

    PY - 1998/1/1

    Y1 - 1998/1/1

    N2 - We study the problem of balancing the load on processors of an arbitrary network. If jobs arrive or depart during the process of load balancing, we have the dynamic load balancing problem; otherwise, we have the static load balancing problem. While static load balancing on arbitrary and special networks has been well studied, very little is known about dynamic load balancing. The difficulty lies in modeling the arrivals and departures of jobs in a clean manner. In this paper, we initiate the study of dynamic load balancing by modeling job traffic using an adversary. Our main result is that a simple, local control distributed load balancing algorithm maintains the load of the network within a stable level against this powerful adversary. Our results hold for different models of traffic patterns and processor communication.

    AB - We study the problem of balancing the load on processors of an arbitrary network. If jobs arrive or depart during the process of load balancing, we have the dynamic load balancing problem; otherwise, we have the static load balancing problem. While static load balancing on arbitrary and special networks has been well studied, very little is known about dynamic load balancing. The difficulty lies in modeling the arrivals and departures of jobs in a clean manner. In this paper, we initiate the study of dynamic load balancing by modeling job traffic using an adversary. Our main result is that a simple, local control distributed load balancing algorithm maintains the load of the network within a stable level against this powerful adversary. Our results hold for different models of traffic patterns and processor communication.

    UR - http://www.scopus.com/inward/record.url?scp=0031643671&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0031643671&partnerID=8YFLogxK

    M3 - Paper

    AN - SCOPUS:0031643671

    SP - 47

    EP - 54

    ER -