Ralf Klasing, Reinhard Lüling, Burkhard Monien  Home/Search
Context Related
| unipaderborn.de/f...sCCC_networks.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 From: unipaderborn.de/fachbereich/A... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the simulation of large cube-connected cycles (CCC) and large butterfly networks (BFN) on smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a fixed size. We show that large CCC's and BFN 's can be embedded into smaller networks of the same type with (a) dilation 2 and optimum load, (b) dilation 1 and optimum load in most cases, (c) dilation 1 and nearly optimum load in all cases. Our... (Update)
Context of citations to this paper: More
...as for the butterfly network, we are able to show in Section 6 that b(DB(m) 1:3171m for all sufficiently large m. 2 Definitions (cf. [KLM90], MS90] The butterfly network BF(m) of dimension m has vertex set Vm = f0; 1; m Gamma 1g Theta f0; 1g m , where f0; 1g m...
.... for references see [35] Embedding Cost X tree(n) Q(n 1) load 1, dilation 2 tree X tree [36] load 16, dilation 3 CCC(l) CCC(k) l k [26] dilation 2 and optimal load dilation 1 and almost optimal load BF(l) BF(k) l k same results as for CCC CCC(n) BF(n) 15] CCC is a...
Cited by: More
Parallel Architectures: Design and Efficient Use - Monien, Feldmann, Klasing.. (1993) (Correct)
Dissemination Of Information In Interconnection.. - Hromkovic, Klasing, .. (1996) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
Similar documents (at the sentence level):
40.2%: Compressing Cube-Connected Cycles and Butterfly Networks - Klasing, Lüling, Monien (1990) (Correct)
5.0%: Improved Compressions of Cube-Connected Cycles Networks - Klasing (Correct)
Active bibliography (related documents): More All
0.4: Optimal Embedding of Complete Binary Trees into Lines.. - Heckmann, Klasing.. (1991) (Correct)
0.3: About the Local Detection of Termination of Local.. - Métivier.. (1997) (Correct)
0.2: Multiple Network Embeddings into Hypercubes - Gupta, Hambrusch (1996) (Correct)
Similar documents based on text: More All
0.2: On the Bisection Width and Expansion of Butterfly Networks - Claudson Bornstein Ami (1997) (Correct)
0.2: On the Communication Throughput of Buffered.. - Rehrmann, Monien.. (1996) (Correct)
0.2: Efficient Use of Parallel & Distributed Systems.. - Monien, Diekmann, .. (1995) (Correct)
Related documents from co-citation: More All
4: Optimal algorithms for dissemination of information in generalized communication.. - Feldmann, Hromkovic et al. - 1992
4: Embedding one Interconnection Network in Another (context) - Monien, Sudborough - 1990
3: Group action graphs and parallel architecture (context) - Annexstein, Baumslag et al. - 1990
BibTeX entry: (Update)
R. Klasing, R. L¨uling, B. Monien, "Compressing cube-connected cycles and butterfly networks", Proc. 2nd IEEE Symposium on Parallel and Distributed Processing, pp. 858-865, 1990. http://citeseer.ist.psu.edu/klasing90compressing.html More
@inproceedings{ klasing90compressing,
author = "Klasing and Luling and Monien",
title = "Compressing Cube-Connected Cycles and Butterfly Networks",
booktitle = "{SPDP}: 2nd {IEEE} Symposium on Parallel and Distributed Processing",
publisher = "ACM Special Interest Group on Computer Architecture (SIGARCH), and IEEE Computer Society",
year = "1990",
url = "citeseer.ist.psu.edu/klasing90compressing.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
196 How to emulate shared memory (context) - Ranade - 1991
124 The cube-connected cycles: a versatile network for parallel .. (context) - Preparata, Vuillemin - 1981
93 Parallel processing with the perfect shuffle (context) - Stone - 1971
61 Embedding one Interconnection Network in Another (context) - Monien, Sudborough - 1990
28 On mapping parallel algorithms into parallel architectures (context) - Berman, Snyder - 1987
26 Optimal Simulations by Butterfly Networks (context) - Bhatt, Chung et al. - 1988
25 Optimal simulations between mesh-connected arrays of process.. (context) - Atallah, Kosaraju - 1988
17 Ultracomputers (context) - Schwartz - 1980
10 Two strategies for solving the Vertex Cover Problem on a Tra.. (context) - Luling, Monien - 1989
9 Quotient networks (context) - Fishburn, Finkel - 1982
8 The classification of coverings of processor networks - Bodlaender - 1989
8 Embedding large tree machines into small ones (context) - Gupta, Hambrusch - 1988
8 Simulating binary trees on X-trees (context) - Monien - 1991
5 Simulation of large networks on smaller networks (context) - Bodlaender, van Leeuwen - 1986
4 Graph embeddings 1988: Recent breakthroughs, new directions (context) - Rosenberg - 1988
2 The Cube-Connected-Cycle is a subgraph of the Butterfly netw.. (context) - Feldmann, Unger - 1992
2 Programming solutions to the algorithm contraction problem (context) - Nelson, Snyder - 1986
2 Cayley-Graphen und Netzwerke (context) - Peine - 1990
2 Simulating large cube-connected cycles and large butterfly n.. (context) - Klasing - 1990
2 Encoding graphs in graphs (context) - Fellows - 1985
2 Compressing meshes into small hypercubes (context) - Ellis, Miller et al.
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/): More
Embedding Ladders and Caterpillars into the Hypercube - Bezrukov, Monien, Unger.. (1997) (Correct)
Sorting Large Data Sets on a Massively Parallel System - Diekmann, Gehring.. (1994) (Correct)
Improved Mesh Generation: Not Simple but Good - Neugebauer, Diekmann (1996) (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