de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Analysis of nearest neighbor load balancing algorithms for random loads

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45344

Sanders,  Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Sanders, P. (1999). Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Computing, 25, 1013-1033.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3594-D
Zusammenfassung
Nearest neighbor load balancing algorithms, like diffusion, are popular due to their simplicity, flexibility, and robustness. We show that they are also asymptotically very efficient when a random rather than a worst case initial load distribution is considered. We show that diffusion needs $\Th{(\log n)^{2/d}}$ balancing time on a $d$-dimensional mesh network with $n^d$ processors. Furthermore, some but not all of the algorithms known to perform better than diffusion in the worst case also perform better for random loads. We also present new results on worst case performance regarding the maximum load deviation.