Ralf Klasing, Burkhard Monien, Regine Peine, Elena A. Stöhr  Home/Search
Context Related
Links: ACM DBLP | unipaderborn.de/f...stBFN_STACS92.ps.Z unipaderborn.de/do...trri93113.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: unipaderborn.de/...communication (more) From: indiana.edu/pub/ucstri/index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Broadcasting is the process of message dissemination in a communication network in which a message originated by one processor is transmitted to all processors of the network. In this paper, we present a new lower bound of 1:7417m for broadcasting in the butterfly network of dimension m. This improves the best known lower bound of 1:5621m. We also describe an algorithm which improves the upper bound from 2m to 2m \Gamma 1. This is shown to be optimal for small dimensions m. In addition, the... (Update)
Context of citations to this paper: More
...by E. Stohr [St91a] which needs 2k rounds for BF k . This bound has been improved to 2k Gamma 1 by Klasing, Peine, Monien and Stohr [KMPS92]. Refinements of these techniques [St92] show that an upper bound of 2k Gamma 1 2 log log k c, for some constant c and all...
Cited by: More
Optimal Algorithms for Broadcast and Gossip in the.. - Hromkovic, al. (Correct)
Dissemination Of Information In Interconnection.. - Hromkovic, Klasing, .. (1996) (Correct)
Dissemination of Information in Vertex-Disjoint Paths.. - Hromkovic, Klasing.. (1993) (Correct)
Active bibliography (related documents): More All
0.2: Parallel Architectures: Design and Efficient Use - Monien, Feldmann, Klasing.. (1993) (Correct)
0.2: Compressing Cube-Connected Cycles and Butterfly Networks - Klasing, Lüling, Monien (1990) (Correct)
0.2: Lower bounds on broadcasting time of de Bruijn type networks - Perennes (1995) (Correct)
Similar documents based on text: More All
0.2: The Cube-Connected Cycles Network Is A Subgraph Of The.. - Feldmann, Unger (1992) (Correct)
0.2: Gossiping in Vertex-Disjoint Paths Mode in.. - Hromkovic.. (1993) (Correct)
0.2: Hyper-Butterfly Network: A Scalable Optimally Fault Tolerant.. - Shi, Srimani (1998) (Correct)
Related documents from co-citation: More All
9: Optimal algorithms for dissemination of information in generalized communication.. - Feldmann, Hromkovic et al. - 1992
4: New gossips and telephones (context) - Knodel - 1975
4: Gossiping in minimal time - Krumme, Cybenko et al. - 1992
BibTeX entry: (Update)
R. Klasing, B. Monien, R. Peine, E. Stohr, "Broadcasting in Butterfly and DeBruijn networks", Proc. STACS'92, Lecture Notes in Computer Science 577, Springer Verlag 1992, pp. 351-362. http://citeseer.ist.psu.edu/klasing92broadcasting.html More
@inproceedings{ klasing92broadcasting,
author = "Ralf Klasing and Burkhard Monien and R. Peine and Elena Stohr",
title = "Broadcasting in Butterfly and DeBruijn Networks",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "351-362",
year = "1992",
url = "citeseer.ist.psu.edu/klasing92broadcasting.html" }
Citations (may not include all citations):127 A group-theoretic model for symmetric interconnection networ.. (context) - Akers, Krishnamurthy - 1989 ACM DBLP
118 Methods and problems of communication in usual networks (context) - Fraigniaud, Lazard - 1991 ACM DBLP
61 Embedding one Interconnection Network in Another (context) - Monien, Sudborough - 1990
48 Group action graphs and parallel architectures (context) - Annexstein, Baumslag et al. - 1990 ACM DBLP
38 de Bruijn multiprocessor network: a versatile parallel proce.. (context) - Samatham, Pradhan - 1989
30 Optimal algorithms for dissemination of information in some .. - Hromkovic, Jeschke et al. - 1990
29 De Bruijn and Kautz networks: a competitor for the hypercube (context) - Bermond, Peyrat - 1989
26 Rinehart and Winston (context) - Brown, Purdom et al. - 1985
23 Broadcasting in bounded degree graphs (context) - Bermond, Hell et al. - 1988 ACM DBLP
18 Broadcast networks of bounded degree (context) - Liestman, Peters - 1988 ACM DBLP
7 Broadcasting and spanning trees in de Bruijn and Kautz netwo.. (context) - Heydemann, Opatrny et al. - 1991 DBLP
4 Compressing cube-connected cycles and butterfly networks - Klasing, Luling et al. - 1990 DBLP
2 Broadcasting in the butterfly network (context) - Stohr - 1991 ACM DBLP
2 Time Bounds for Broadcasting in Bounded Degree Graphs (context) - Capocelli, Gargano et al. - 1989 ACM
2 the broadcast time of the butterfly network (context) - Stohr - 1991
2 Broadcasting in deBruijn networks (context) - Bermond, Peyrat - 1988
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/communication.html): More
Dissemination Of Information In Interconnection.. - Hromkovic, Klasing, .. (1996) (Correct)
Gossiping in Vertex-Disjoint Paths Mode in.. - Hromkovic.. (1993) (Correct)
Note on Optimal Gossiping in some Weak-Connected Graphs - Hromkovic, Jeschke, Monien (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC