[图书][B] Parallel system interconnections and communications

MD Grammatikakis, DF Hsu, M Kraetzl - 2018 - taylorfrancis.com
This introduction to networking large scale parallel computer systems acts as a primary
resource for a wide readership, including network systems engineers, electronics engineers …

Nonblocking on-chip interconnection networks

T Jain - 2020 - kluedo.ub.rptu.de
Interconnection networks enable fast data communication between components of a digital
system. The selection of an appropriate interconnection network and its architecture plays …

A new self-routing multicast network

Y Yang, J Wang - IEEE Transactions on Parallel and …, 1999 - ieeexplore.ieee.org
In this paper, we propose a design for a new self-routing multicast network which can realize
arbitrary multicast assignments between its inputs and outputs without any blocking. The …

Adaptive binary sorting schemes and associated interconnection networks

MV Chien, AY Oruc - IEEE Transactions on Parallel and …, 1994 - ieeexplore.ieee.org
Many routing problems in parallel processing, such as concentration and permutation
problems, can be cast as sorting problems. In this paper, we consider the problem of sorting …

Crosspoint complexity of sparse crossbar concentrators

AY Oruc, HM Huang - IEEE Transactions on Information Theory, 1996 - ieeexplore.ieee.org
A sparse crossbar (n, m, c)-concentrator is a bipartite graph with n inputs and m outputs in
which any c or fewer inputs can be matched with an equal number of outputs, where c is …

Regular sparse crossbar concentrators

W Guo, AY Oruç - IEEE Transactions on Computers, 1998 - ieeexplore.ieee.org
A bipartite concentrator is a single stage sparse crossbar switching device that can connect
any m of its n/spl ges/m inputs to its m outputs, possibly without the ability to distinguish their …

A new self-routing permutation network

WJ Cheng, WT Chen - IEEE transactions on computers, 1996 - ieeexplore.ieee.org
In this paper, a self-routing permutation network based on a binary radix sorting network has
been proposed. It has O (log/sup 2/n) propagation delay and O (n log/sup 2/n) hardware …

Routing permutations on baseline networks with node-disjoint paths

Y Yang, J Wang - IEEE Transactions on Parallel and …, 2005 - ieeexplore.ieee.org
Permutation is a frequently-used communication pattern in parallel and distributed
computing systems and telecommunication networks. Node-disjoint routing has important …

Verifying the concentration property of permutation networks by BDDs

T Jain, K Schneider - … on Formal Methods and Models for …, 2016 - ieeexplore.ieee.org
A concentrator is a circuit with n inputs and m≤ n outputs that can route any given subset of
k≤ m valid inputs to k of its m outputs. Concentrator circuits are important for many …

High performance concentrators and superconcentrators using multiplexing schemes

MV Chien, AY Oruç - IEEE Transactions on Communications, 1994 - ieeexplore.ieee.org
Concentrators are used to interface and combine together low speed communication
channels onto higher speed transmission links to alleviate transmission costs. They are also …