Properties and performance of folded hypercubes

El-Amawy, A.; Latifi, Shahram

doi:10.1109/71.80187

Cited by 410 publications

(154 citation statements)

References 8 publications

Supporting

Mentioning

153

Contrasting

Order By: Relevance

“…At 100% load, one cell is generated at every time unit in every node. The simulation results are similar to the analytical results of [LaE89,ElL91]. The average distance figures of the analytical and simulation results are compared in Table 3.1.…”

Section: Simulation Resultssupporting

confidence: 77%

“…In an FHC(n), the shortest distance between any two nodes is min(||a||, n -||a|| + 1). From this, the following useful property of FHC is stated by [ElL91,LaE89]:…”

Section: The Folded Hypercube and Bisectional Interconnection Networkmentioning

confidence: 99%

“…A second possibility of future work is the implementation of broadcast and multicast in the three new switches. The FHC has the broadcast capability and the designers of the FHC have given an algorithm to broadcast cells over the FHC in their papers [ElL91,LaE89]. Adding multicast capability to the new switches by modifying the current routing algorithm will make the switches more attractive.…”

Section: Possible Future Workmentioning

confidence: 99%

“…In this chapter, I propose three new ATM switch architectures that use the folded hypercube (FHC) [ElL91,LaE89] as the switching fabric. [Ho92] has shown that bisectional interconnection network of 2 n nodes for any even n, is isomorphic to the FHC(n).…”

Section: New Atm Switches Based On the Folded Hypercubementioning

confidence: 99%

See 3 more Smart Citations

The Folded Hypercube ATM Switches

Park

Davis

2001

Networking — ICN 2001

View full text Add to dashboard Cite

Over the past few years, many high performance asynchronous transfer mode (ATM) switches have been proposed. The majority of these switches have high performance but also high hardware complexity. Therefore, there is a need for switch designs with low complexity and high performance. This research proposes three new ATM switches based on the folded hypercube network (FHC). The performance of the three architectures are studied using a network model and simulation. The major performance parameters measured are the cell loss rate and cell delay time through the switch under uniform, normal, and bursty traffic patterns. To guarantee faster switching of time-sensitive cells, the routing algorithm of the three switches uses a priority scheme that gives higher precedence to the time-sensitive cells. Also, an output buffer controller is designed to manage the buffers in a fair manner. The three proposed switch architectures have lower complexity while providing equivalent or better switching performance compared to other more complex ATM switches described in the literature. This research shows a new approach to designing ATM switches by using the FHC as the switching fabric for the first time instead of using the crossbar, multi-path, or Banyan-based switching fabrics.iii DedicationsAfter a long and painful fight against cancer, my grandfather passed away on Christmas Eve, 1999.He deeply wanted to, but was not able to see me receive the doctorate degree. I was blessed to receive his continual love and support for me. I hope he is looking down on me from heaven feeling proud.This dissertation is dedicated to my grandfather, Wookyu Park, in his loving memory.

show abstract

Section: Simulation Resultssupporting

confidence: 77%

“…In an FHC(n), the shortest distance between any two nodes is min(||a||, n -||a|| + 1). From this, the following useful property of FHC is stated by [ElL91,LaE89]:…”

Section: The Folded Hypercube and Bisectional Interconnection Networkmentioning

confidence: 99%

Section: Possible Future Workmentioning

confidence: 99%

Section: New Atm Switches Based On the Folded Hypercubementioning

confidence: 99%

See 2 more Smart Citations

The Folded Hypercube ATM Switches

Park

Davis

2001

Networking — ICN 2001

View full text Add to dashboard Cite

show abstract

“…Figure 3 (b) shows the TTN (2,3,1). With the increase of inter-level connectivity, the network diameter decreases, while the bisection width increases.…”

Section: Lemma 1: Amentioning

confidence: 99%

TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers

Rahman

Inoguchi²,

Sato³

et al. 2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYInterconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the TTN and explores aspects such as node degree, network diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the TTN using four virtual channels and evaluate the network's dynamic communication performance using the proposed routing algorithm under uniform and various non-uniform traffic patterns. We evaluate the dynamic communication performance of TTN, TESH, MH3DT, mesh, and torus networks by computer simulation. It is shown that the TTN possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, and high throughput and very low zero load latency, which provide better dynamic communication performance than that of other conventional and hierarchical networks.

show abstract

Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm

Zhang

Qiu

Kim

2015

Concurrency and Computation

View full text Add to dashboard Cite

Summary Hyper‐star graph HS(2n,n) was introduced to be a competitive model to both hypercubes and star graphs. In this paper, we study its properties by (1) giving a closed form solution to the surface area of HS(2n,n), (2) discussing its Hamiltonicity by establishing an isomorphism between the graph and the well‐known middle levels problem, and (3) showing that full binary trees can be embedded into HS(2n,n) with dilation 1. We also develop a single‐port optimal neighbourhood broadcasting algorithm for HS(2n,n). Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Properties and performance of folded hypercubes

Cited by 410 publications

References 8 publications

The Folded Hypercube ATM Switches

The Folded Hypercube ATM Switches

TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers

Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm

Contact Info

Product

Resources

About