International audienceOur aim was to find bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus, and the network diameter. Point‐to‐point networks are a special case of bus networks in which every bus connects only two processors. In this case, de Bruijn and Kautz networks and their generalizations are known to be among the best families of networks with respect to the aforementioned criteria. In this paper, we present the directed de Bruijn bus networks, which connect two or more processors on a bus and contain the point‐to‐point de Bruijn networks and their generalization as a special case. We study two different scheme...
. In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point inte...
This paper deals with the analysis of the throughput performance of various logical topologies for M...
A binary-tree algorithm, Bin(n), proceeds level-by-level from the leaves of a 2n-leaf balanced binar...
AbstractIn bus interconnection networks every bus provides a communication medium between a set of p...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
Abstract: In order to build large shared-memory multiprocessor systems that take advantage of curren...
The end product of this research is the development of an efficient method of interconnecting hundre...
The design of an efficient distributed memory transputer network is a difficult issue. In order to c...
In this paper we describe four topologies for interconnecting many identical processors into a compu...
Building flexible constraint length Viterbi decoders requires us to be able to realize de Bruijn net...
Since the cost of the interconnection network grows with the number of buses (due to the connection ...
[[abstract]]The performance of multiple-bus networks with full bus-memory connection, single bus-mem...
We derive a family of labeled, undirected graphs from the Stirling table of the first kind and inves...
. In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point inte...
This paper deals with the analysis of the throughput performance of various logical topologies for M...
A binary-tree algorithm, Bin(n), proceeds level-by-level from the leaves of a 2n-leaf balanced binar...
AbstractIn bus interconnection networks every bus provides a communication medium between a set of p...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
[[abstract]]The authors study the performance of multiprocessor systems employing multiple buses as ...
Abstract: In order to build large shared-memory multiprocessor systems that take advantage of curren...
The end product of this research is the development of an efficient method of interconnecting hundre...
The design of an efficient distributed memory transputer network is a difficult issue. In order to c...
In this paper we describe four topologies for interconnecting many identical processors into a compu...
Building flexible constraint length Viterbi decoders requires us to be able to realize de Bruijn net...
Since the cost of the interconnection network grows with the number of buses (due to the connection ...
[[abstract]]The performance of multiple-bus networks with full bus-memory connection, single bus-mem...
We derive a family of labeled, undirected graphs from the Stirling table of the first kind and inves...
. In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point inte...
This paper deals with the analysis of the throughput performance of various logical topologies for M...
A binary-tree algorithm, Bin(n), proceeds level-by-level from the leaves of a 2n-leaf balanced binar...