Guihai Chen, Francis C.M. Lau  Home/Search
Context
Related
| usc.edu/~hipc/hipc97/papers/041.ps usc.edu/~hipc97/papers/041.ps 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: hipc.org/hipc97/total (more) From: prism.uvsq.fr/archi/pubs...hipc97 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Preparata and Vuillemin proposed the cubeconnected cycles (CCC) in 1981 [16], and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of the Preparata-Vuillemin layout. We also give a non-trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new layout and the lower bound. We conjecture that the new layout is optimal (minimal). Keywords:... (Update)
Similar documents (at the sentence level):
17.5%: Tighter Layouts of the Cube-Connected Cycles - Chen, Lau (1997) (Correct)
6.6%: Layout of the Cube-Connected Cycles without Long Wires - Chen, Lau (1997) (Correct)
5.0%: Layout of the Cube-Connected Cycles Without Long Wires - Chen, Lau (2001) (Correct)
Active bibliography (related documents): More All
0.2: Compact Grid Layouts of Some Multi-Level Networks - Muthukrishnan, Paterson.. (1999) (Correct)
0.2: Regular Layouts of Butterfly Networks - Keller (1994) (Correct)
0.2: Compact Grid Layouts of Multi-Level Networks - Muthukrishnan, Paterson.. (1999) (Correct)
Similar documents based on text: More All
0.3: Improved Compressions of Cube-Connected Cycles Networks - Klasing (Correct)
0.3: Perfect Dominating Sets on Cube-Connected Cycles - Van Wieren, Livingston, Stout (1993) (Correct)
0.3: Multilayer VLSI Layout for Interconnection Networks - Yeh, Varvarigos, Parhami (2000) (Correct)
BibTeX entry: (Update)
@misc{ chen-tight,
author = "Guihai Chen and Francis C.M. Lau",
title = "A Tight Layout of the Cube-Connected Cycles",
url = "citeseer.ist.psu.edu/38110.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
221 Introduction to VLSI Systems (context) - Mead, Conway - 1980
124 The cubeconnected cycles: A versatile network for parallel c.. (context) - Preparata, Vuillemin - 1981
86 A framework for solving VLSI graph layout problem - Bhatt, Leighton - 1984
64 Area-time complexity for VLSI (context) - Thompson - 1979
48 Group action graphs and parallel architecture (context) - Annexstein, Baumslag et al. - 1990
37 A unified theory of interconnection network structure - Kruskal, Snir - 1986
23 Complexity Issues in VLSI: Optimal Layout for the Shuffle-Ex.. (context) - Leighton - 1983
14 A tight layout of the butterfly network - Avior, Calamoneri et al. - 1996
13 The flip network in STARAN (context) - Batcher - 1976
12 Channel routing in knock-knee mode: Simplified algorithms an.. (context) - Mehlhorn, Preparata et al. - 1986
10 Compact layouts of Banyan/FFT networks (context) - Wise - 1981
7 Processor networks and interconnection networks without long.. (context) - Beigel, Kruskal - 1989
3 Equivalence between cube-connected cycles networks and circu.. (context) - Jain - 1986
3 CMU Computer Science Department (context) - Thompson, Theory et al. - 1980
3 IEEE Transactions on Parallel and Distributed Systems (context) - Lau, Chen et al. - 1996
1 Cubical bus connected columns: An alternative to hypercube (context) - Bhattacharya, Liang et al. - 1991
1 a new family of Cayley graph interconnection networks of con.. (context) - Chen, Lau
1 Yield enhancement designs for wsi cube connected cycles (context) - Shen, Koren - 1989
Documents on the same site (http://hipc.org/hipc97/total.html): More
An Object Oriented System for Developing Distributed Applications - Singh, Gu (1997) (Correct)
ELMO: Extending (Sequential) Languages with Migratable.. - Richards, Ramkumar.. (Correct)
Lazy Home Migration for Distributed Shared Memory Systems - Baylor, Ekanadham.. (1997) (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