Distributed full switch as an ideal system area network for multiprocessor computers

Authors:
M. F. Karavai;V. S. Podlazov
Affiliations:
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2013

Citing 11
Cited 0

On-line Algorithms for Path Selectionin a Nonblocking Network

SIAM Journal on Computing
Routing a permutation in the hypercube by two sets of edge disjoint paths

Journal of Parallel and Distributed Computing
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
The BlackWidow High-Radix Clos Network

Proceedings of the 33rd annual international symposium on Computer Architecture
Fault-tolerant expansion of system area networks in multiprocessor computer systems

Automation and Remote Control
Toward Ideal On-Chip Communication Using Express Virtual Channels

IEEE Micro
Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

Automation and Remote Control
An efficient load balancing algorithm employing a symmetric balanced incomplete block design

ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
The PERCS High-Performance Interconnect

HOTI '10 Proceedings of the 2010 18th IEEE Symposium on High Performance Interconnects
The Gemini System Interconnect

HOTI '10 Proceedings of the 2010 18th IEEE Symposium on High Performance Interconnects
An invariant extension method for system area networks of multicore computational systems. An ideal system network

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a way to build distributed full switches of an arbitrary size, consisting of small fixed-size switches and channel splitters. The distributed switch preserves the nonblocking and self-routing properties of a full switch and forms an ideal system area network.