An invariant extension method for system area networks of multicore computational systems. An ideal system network

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:
2010

Citing 6
Cited 1

Counterexample to a conjecture of Szymanski on hypercube routing

Information Processing Letters
Routing a permutation in the hypercube by two sets of edge disjoint paths

Journal of Parallel and Distributed Computing
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

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

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method of extending non-blocking self-routing uniform system area networks that preserves the specified properties. The method is based on the mathematical theory of complete balanced block designs, studied in combinatorics.