Embedding even-length cycles in a hexagonal honeycomb mesh
The existence and construction of cycles of various lengths in an interconnection network are important issues in efficiently executing ring-structured parallel algorithms in such a network. The hexagonal honeycomb mesh (HHM) is regarded as a promising candidate for interconnection networks. In this paper we address the problem of how to embed even-length cycles in an HHM. We prove that an HHM of order t≥3 admits a cycle of length l for each even number l such that l=6 or 10≤l≤6t2-2. We also describe a systematic method for building these cycles.
Keywords: Cycle embedding; Hexagonal honeycomb mesh; Interconnection network
Document Type: Research Article
Affiliations: 1: College of Computer Science, Chongqing University, Chongqing, China,School of Computer and Information, Chongqing Jiaotong University, Chongqing, China 2: College of Computer Science, Chongqing University, Chongqing, China 3: School of Computer and Information, Chongqing Jiaotong University, Chongqing, China 4: Department of Chemistry, Eighth Senior School, Chongqing, China
Publication date: 01 February 2008
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content