Skip Navigation

The Computer Journal 2001 44(5):374-383; doi:10.1093/comjnl/44.5.374
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chen, G.
Right arrow Articles by Lau, F. C. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Layout of the Cube-connected Cycles without Long Wires

Guihai Chen1 and Francis C. M. Lau2

1 State Key Lab for Novel Software Technology, Nanjing University, Nanjing 210093, China 2 Department of Computer Science and Information Systems, The University of Hong Kong, Pokfulam Road, Hong Kong, China Email: fcmlau@csis.hku.hk

Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper gave an asymptotically-optimal layout scheme for the CCC. While all the known optimal layouts of the CCC, including the Preparata–Vuillemin layout, have long wires, we give a new layout scheme which has no long wires while keeping the asymptotically-optimal area. Hence, we can conclude that the CCC can be laid out optimally (within a constant factor) both in area and in wire length. We also show how large a constant-factor blow-up in area is needed in order not to produce any long wire in the layout.

Received 8 October, 1999. Revised 28 February, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.