Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Dynamic diffusion load balancing

Tools
- Tools
+ Tools

UNSPECIFIED (2005) Dynamic diffusion load balancing. In: 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), JUL 11-15, 2005, Lisbon, PORTUGAL.

Full text not available from this repository.

Abstract

We consider the problem of dynamic load balancing in arbitrary (connected) networks on n nodes. Our load generation model is such that during each round, n tasks are generated on arbitrary nodes, and then (possibly after some balancing) one task is deleted from every non-empty node. Notice that this model fully saturates the resources of the network in the sense that we generate just as many new tasks per round as the network is able to delete. We show that even in this situation the system is stable, in that the total load remains bounded (as a function of n alone) over time. Our proof only requires that the underlying "communication" graph be connected. (It of course also works if we generate less than n new tasks per round, but the major contribution of this paper is the fully saturated case.) We further show that the upper bound we obtain is asymptotically tight (up to a moderate multiplicative constant) by demonstrating a corresponding lower bound on the system load for the particular example of a linear array (or path). We also show some simple negative results (i.e., instability) for work-stealing based diffusion-type algorithms in this setting.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name: LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title: AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS
Publisher: SPRINGER-VERLAG BERLIN
ISBN: 3-540-27580-0
ISSN: 0302-9743
Editor: Caires, L and Italiano, GE and Monteiro, L and Palamidessi, C and Yung, M
Date: 2005
Volume: 3580
Number of Pages: 13
Page Range: pp. 1386-1398
Publication Status: Published
Title of Event: 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005)
Location of Event: Lisbon, PORTUGAL
Date(s) of Event: JUL 11-15, 2005
URI: http://wrap.warwick.ac.uk/id/eprint/6703

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us