File Download
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: A tight layout of the cube-connected cycles
Title | A tight layout of the cube-connected cycles |
---|---|
Authors | |
Keywords | Interconnection networks VLSI Cube-connected cycles Embedding Routing |
Issue Date | 1997 |
Publisher | IEEE Computer Society. |
Citation | The 4th International Conference on High Performance Computing, Bangalore, India, 18-21 December 1997, p. 422-427 How to Cite? |
Abstract | Preparata 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 Identifier | http://hdl.handle.net/10722/45582 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, G | en_HK |
dc.contributor.author | Lau, FCM | en_HK |
dc.date.accessioned | 2007-10-30T06:29:41Z | - |
dc.date.available | 2007-10-30T06:29:41Z | - |
dc.date.issued | 1997 | en_HK |
dc.identifier.citation | The 4th International Conference on High Performance Computing, Bangalore, India, 18-21 December 1997, p. 422-427 | en_HK |
dc.identifier.isbn | 0-8186-8067-9 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/45582 | - |
dc.description.abstract | Preparata 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.extent | 574992 bytes | - |
dc.format.extent | 7862 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE Computer Society. | en_HK |
dc.relation.ispartof | International 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. | - |
dc.subject | Interconnection networks | en_HK |
dc.subject | VLSI | en_HK |
dc.subject | Cube-connected cycles | en_HK |
dc.subject | Embedding | en_HK |
dc.subject | Routing | en_HK |
dc.title | A tight layout of the cube-connected cycles | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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+cycles | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/HIPC.1997.634524 | en_HK |
dc.identifier.hkuros | 29730 | - |