File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A tight layout of the cube-connected cycles

TitleA tight layout of the cube-connected cycles
Authors
KeywordsInterconnection networks
VLSI
Cube-connected cycles
Embedding
Routing
Issue Date1997
PublisherIEEE Computer Society.
Citation
The 4th International Conference on High Performance Computing, Bangalore, India, 18-21 December 1997, p. 422-427 How to Cite?
AbstractPreparata and Vuillemin proposed the cubeconnected cycles (CCC) in 1981 [lS], 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 th,e 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 conjectur.e that the new layout is optimal (minimal).
Persistent Identifierhttp://hdl.handle.net/10722/45582
ISBN

 

DC FieldValueLanguage
dc.contributor.authorChen, Gen_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2007-10-30T06:29:41Z-
dc.date.available2007-10-30T06:29:41Z-
dc.date.issued1997en_HK
dc.identifier.citationThe 4th International Conference on High Performance Computing, Bangalore, India, 18-21 December 1997, p. 422-427en_HK
dc.identifier.isbn0-8186-8067-9en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45582-
dc.description.abstractPreparata and Vuillemin proposed the cubeconnected cycles (CCC) in 1981 [lS], 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 th,e 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 conjectur.e that the new layout is optimal (minimal).en_HK
dc.format.extent574992 bytes-
dc.format.extent7862 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE Computer Society.en_HK
dc.relation.ispartofInternational Conference on High Performance Computing-
dc.rights©1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectInterconnection networksen_HK
dc.subjectVLSIen_HK
dc.subjectCube-connected cyclesen_HK
dc.subjectEmbeddingen_HK
dc.subjectRoutingen_HK
dc.titleA tight layout of the cube-connected cyclesen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0-8186-8067-9&volume=&spage=422&epage=427&date=1997&atitle=A+tight+layout+of+the+cube-connected+cyclesen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/HIPC.1997.634524en_HK
dc.identifier.hkuros29730-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats