KIT | KIT-Bibliothek | Impressum | Datenschutz

Some implementations results on random polling dynamic load balancing

Sanders, Peter

Abstract:

Using two sample applications, we demonstrate the effectiveness of our
portable and reusable library for parallel tree search. On 1024
Transputers we achieve near optimal speedup even for quite small
instances of the `Golomb ruler' problem. The `0/1 knapsack
problem' is more challenging but it is possible to achieve superlinear
speedup compared to the standard sequential depth first algorithm the
implementation is based on.

Open Access Logo


Cover der Publikation
Zugehörige Institution(en) am KIT Informatik für Ingenieure und Naturwissenschaftler (Inf. für Ing. u. Naturwiss.)
Publikationstyp Buch
Publikationsjahr 1995
Sprache Englisch
Identifikator urn:nbn:de:swb:90-AAA67955
KITopen-ID: 6795
Erscheinungsvermerk Karlsruhe 1995. (Interner Bericht. Fakultät für Informatik, Universität Karlsruhe. 1995,40.)
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page