Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Symmetric vs. Asymmetric Multiple-Choice Algorithms

Vöcking, B. (2001). Symmetric vs. Asymmetric Multiple-Choice Algorithms. In Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE) (pp. 1-10). Waterloo, Ontario, Canada: Carleton Scientific.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-31C3-3 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-31C4-1
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Vöcking, Berthold1, Autor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Multiple-choice allocation algorithms have been studied intensively over the last decade. These algorithms have several applications in the areas of load balancing, routing, resource allocation and hashing. The underlying idea is simple and can be explained best in the balls-and-bins model: Instead of assigning balls (jobs, requests, or keys) simply at random to bins (machines, servers, or positions in a hash table), choose first a small set of bins at random, inspect these bins, and place the ball into one of the bins containing the smallest number of balls among them. The simple idea of first selecting a small set of alternatives at random and then making the final choice after careful inspection of these alternatives leads to great improvements against algorithms that place their decisions simply at random. We illustrate the power of this principle in terms of simple balls-and-bins processes. In particular, we study recently presented algorithms that treat bins asymmetrically in order to obtain a better load balancing. We compare the behavior of these asymmetric schemes with symmetric schemes and prove that the asymmetric schemes achieve a better load balancing than their symmetric counterparts.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-022001
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Waterloo, Ontario, Canada : Carleton Scientific
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 518213
Anderer: Local-ID: C1256428004B93B8-D5614A051ADC0E3DC1256B7F005CAAAE-Voecking2001c
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Aarhus
Start-/Enddatum: 2001-08-27 - 2001-08-27

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Waterloo, Ontario, Canada : Carleton Scientific
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 1 - 10 Identifikator: -