Results 191 to 200 of about 8,796 (225)
Some of the next articles are maybe not open access.
2006 Canadian Conference on Electrical and Computer Engineering, 2006
Techniques for advanced logic design in spatial dimensions for the purposes of nano-devices and nanoICs are being formulated to incorporate topologies that satisfy certain requirements of nanotechnology. The hypercube is considered a relevant topology for this design.
Loyd Reed Hook, Samuel C. Lee
openaire +1 more source
Techniques for advanced logic design in spatial dimensions for the purposes of nano-devices and nanoICs are being formulated to incorporate topologies that satisfy certain requirements of nanotechnology. The hypercube is considered a relevant topology for this design.
Loyd Reed Hook, Samuel C. Lee
openaire +1 more source
2006
In this paper we propose a semi-distributed self-diagnostic algorithm for Hypercube networks which is based on the use of a combinatorial structure known as the Hadamard matrix. We propose a model for providing fault- tolerance to the diagnostic scheme and to analyze the performance of the proposed diagnostic scheme.
Arif Ghafoor, Patrick Solé
openaire +1 more source
In this paper we propose a semi-distributed self-diagnostic algorithm for Hypercube networks which is based on the use of a combinatorial structure known as the Hadamard matrix. We propose a model for providing fault- tolerance to the diagnostic scheme and to analyze the performance of the proposed diagnostic scheme.
Arif Ghafoor, Patrick Solé
openaire +1 more source
IEEE Transactions on Computers, 1988
Since a k-dimensional hypercube has 2/sup k/ vertices, these systems are restricted to having exactly 2/sup k/ computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes,
openaire +1 more source
Since a k-dimensional hypercube has 2/sup k/ vertices, these systems are restricted to having exactly 2/sup k/ computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes,
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1989
This paper considers the following game on a hypercube, first suggested by Lagarias and Saks. Suppose $2^n$ pebbles are distributed onto vertices of an n-cube (with $2^n$ vertices). A pebbling step is to remove two pebbles from some vertex and then place one pebble at an adjacent vertex. The question of interest is to determine if it is possible to get
openaire +1 more source
This paper considers the following game on a hypercube, first suggested by Lagarias and Saks. Suppose $2^n$ pebbles are distributed onto vertices of an n-cube (with $2^n$ vertices). A pebbling step is to remove two pebbles from some vertex and then place one pebble at an adjacent vertex. The question of interest is to determine if it is possible to get
openaire +1 more source
IEEE Transactions on Computers, 1991
A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and
Nian-Feng Tzeng, Sizheng Wei
openaire +1 more source
A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and
Nian-Feng Tzeng, Sizheng Wei
openaire +1 more source
Random Structures and Algorithms, 2005
A point \(p\) in \(\mathbb R^d\) is said to dominate another point \(q\) if the difference \(p-q\) has only nonnegative coordinates. The nondominated points in a set of points are called maxima. The interest of studying dominance and maxima is multifold. First, dominance represents one of the most natural partial orders for multidimensional points, and
Zhi-Dong Bai +3 more
openaire +1 more source
A point \(p\) in \(\mathbb R^d\) is said to dominate another point \(q\) if the difference \(p-q\) has only nonnegative coordinates. The nondominated points in a set of points are called maxima. The interest of studying dominance and maxima is multifold. First, dominance represents one of the most natural partial orders for multidimensional points, and
Zhi-Dong Bai +3 more
openaire +1 more source
Journal of Graph Theory, 1984
AbstractAn induced subgraph G of a graph H is a retract of H if there is an edge‐preserving map f from H onto G such that f|G is the identity map on G. A median graph is a connected graph such that for any three vertices u,v and w, there exists a unique vertex x which lies simultaneously on some shortest (u,v)‐, (v,w)‐, and (w,u)‐paths.
openaire +2 more sources
AbstractAn induced subgraph G of a graph H is a retract of H if there is an edge‐preserving map f from H onto G such that f|G is the identity map on G. A median graph is a connected graph such that for any three vertices u,v and w, there exists a unique vertex x which lies simultaneously on some shortest (u,v)‐, (v,w)‐, and (w,u)‐paths.
openaire +2 more sources
SIAM Journal on Computing, 1998
Summary: This paper provides an analysis of a natural \(d\)-round tournament over \(n = 2^{d}\) players and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is used to design efficient sorting algorithms for several models of parallel computation: (i) a comparator network of ...
Frank Thomson Leighton, C. Greg Plaxton
openaire +2 more sources
Summary: This paper provides an analysis of a natural \(d\)-round tournament over \(n = 2^{d}\) players and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is used to design efficient sorting algorithms for several models of parallel computation: (i) a comparator network of ...
Frank Thomson Leighton, C. Greg Plaxton
openaire +2 more sources
1992
New approach to the fragmentation problem of hypercube multiprocessors with dynamic allocation of subcubes is proposed. It is based on constructing Hamiltonian circuits of incomplete hypercubes. The main result is a constructive proof that an n-cube from which up to n−2 vertex-disjoint subcubes are removed so that it remains connected is a Hamiltonian ...
openaire +1 more source
New approach to the fragmentation problem of hypercube multiprocessors with dynamic allocation of subcubes is proposed. It is based on constructing Hamiltonian circuits of incomplete hypercubes. The main result is a constructive proof that an n-cube from which up to n−2 vertex-disjoint subcubes are removed so that it remains connected is a Hamiltonian ...
openaire +1 more source
2012
We define hypercubes of duality—of which the modern square of opposition is an emblematic example—in proper mathematical terms, as orbits under some action of the additive group \(\mathbb{Z}_{2}^{m}\), with m∈ℕ. We then introduce a notion of dimension for duality in classical logic and show, for example, how propositional expressions in at most three ...
openaire +2 more sources
We define hypercubes of duality—of which the modern square of opposition is an emblematic example—in proper mathematical terms, as orbits under some action of the additive group \(\mathbb{Z}_{2}^{m}\), with m∈ℕ. We then introduce a notion of dimension for duality in classical logic and show, for example, how propositional expressions in at most three ...
openaire +2 more sources