Algorithms and properties of a new two-level network with folded hypercubes as basic modules
DR Duh, GH Chen, JF Fang - IEEE Transactions on Parallel …, 1995 - ieeexplore.ieee.org
In this paper, a new two-level interconnection network, called a hierarchical folded-
hypercube network (HFN, for short), is proposed. The HFN takes folded hypercubes as basic …
hypercube network (HFN, for short), is proposed. The HFN takes folded hypercubes as basic …
Topological properties, communication, and computation on WK‐recursive networks
GH Chen, DR Duh - Networks, 1994 - Wiley Online Library
Recently, with the support of the CAPRI (Concurrent Architecture and PRogramming
environment for highly Integrated system) project, Vecchia and Sanges proposed a new …
environment for highly Integrated system) project, Vecchia and Sanges proposed a new …
Topological properties of WK-recursive networks
DR Duh, GH Chen - Journal of Parallel and Distributed Computing, 1994 - Elsevier
The WK-recursive networks, which have been proposed by Vecchia and Sanges, offer high
degree of regularity, scalability, and symmetry. They have also the properties of expansibility …
degree of regularity, scalability, and symmetry. They have also the properties of expansibility …
Least common ancestor networks
ID Scherson, CK Chien - VLSI Design, 1995 - Wiley Online Library
Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of
networks that include fattrees, baseline networks, SW‐banyans and the router networks of …
networks that include fattrees, baseline networks, SW‐banyans and the router networks of …
Design and analysis of a generalized architecture for reconfigurable m-ary tree structures
S Srinivas, NN Biswas - IEEE transactions on computers, 1992 - computer.org
A generalized architecture is presented for reconfigurable m-ary tree structures, where m is
any integer< 1. The approach is based on a generalized multistage interconnection network …
any integer< 1. The approach is based on a generalized multistage interconnection network …
Reflective interconnection networks
B Wilkinson, JM Farmer - Computers & electrical engineering, 1994 - Elsevier
In this paper, a class of single-sided multiprocessor multistage interconnection networks
(MINs), which we call 'reflective'networks, is proposed. A common characteristic of reflective …
(MINs), which we call 'reflective'networks, is proposed. A common characteristic of reflective …
Communications, routage et architectures des machines à mémoire distribuée autour du routage Wormhole
É Fleury - 1996 - theses.fr
En moins de dix ans, le calcul parallèle a émergé comme une solution possible aux besoins
sans cesse croissants de puissance de calcul. Cette accélération dans le développement et …
sans cesse croissants de puissance de calcul. Cette accélération dans le développement et …
Periodic gossi** in back-to-back trees
R Labahn, A Raspaud - Discrete applied mathematics, 1997 - Elsevier
The d-ary back-to-back tree of height k, BBTkd, consists of two complete d-ary trees of height
k the leaves of which are identified. For a proper coloring of the edges of BBTkd with c⩾ d+ 1 …
k the leaves of which are identified. For a proper coloring of the edges of BBTkd with c⩾ d+ 1 …
Self-routing lowest common ancestor networks
CK Chien, ID Scherson - 1992 - escholarship.org
Multistage interconnection networks (MIN's) allow communication between terminals on
opposing sides of a network. Lowest Common Ancestor Networks (LCAN's)[1] have switches …
opposing sides of a network. Lowest Common Ancestor Networks (LCAN's)[1] have switches …
Lowest common ancestor interconnection networks
BD Alleyne, CK Chien, ID Scherson - 1992 - escholarship.org
Lowest Common Ancestor (LCA) networks are built using switches capable of connecting u+
d inputs/outputs in a permutation pattern. For n source nodes and I stages of switches, n/d …
d inputs/outputs in a permutation pattern. For n source nodes and I stages of switches, n/d …