Campus Event Calendar
Event Entry
New for: D3
What and Who
Fast Broadcasting and Reduction
Peter Sanders
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 21 August 2000
13:30
30 Minutes
Warning: Date has changed!
46
024
Saarbrücken
Abstract
The ``fractional tree'' algorithm for broadcasting and reduction is
introduced. Its communication pattern interpolates between two well
known patterns --- sequential pipeline and pipelined binary
tree. The speedup over the best of these simple methods can approach
two for large systems and messages of intermediate size. For networks
which are not very densely connected the new algorithm seems to be the
best known method for the important case that each processor has only
a single (possibly bidirectional) channel into the communication
network.
Contact
Peter Sanders
--email hidden
passcode not visible
logged in users only