Home News About Us Contact Contributors Disclaimer Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents



ID: 518108.0, MPI für Informatik / Algorithms and Complexity Group
A Bandwidth Latency Tradeoff for Broadcast and Reduction
Authors:Sanders, Peter; Sibeyn, Jop F.
Language:English
Publisher:Springer
Place of Publication:Berlin, Germany
Date of Publication (YYYY-MM-DD):2000
Title of Proceedings:Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00)
Start Page:918
End Page:926
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Munich, Germany
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2000
Audience:Experts Only
Intended Educational Use:No
Abstract / Description: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.
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-6078B6DE7275DF63C12569DD006A4454-...
ISBN:3-540-67956-1
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.