Sciweavers

73 search results - page 1 / 15
» Efficient Connectivity Testing of Hypercubic Networks with F...
Sort
View
IWOCA
2010
Springer
185views Algorithms» more  IWOCA 2010»
12 years 11 months ago
Efficient Connectivity Testing of Hypercubic Networks with Faults
Tomás Dvorák, Jirí Fink, Petr...
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
13 years 4 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
ICNS
2009
IEEE
13 years 2 months ago
HGRID: Fault Tolerant, Log2N Resource Management for Grids
Grid Resource Discovery Service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fau...
Antonia Gallardo, Kana Sanjeevan, Luis Díaz...
APCSAC
2005
IEEE
13 years 10 months ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
Zhang Xinhua, Peter Loh
IPPS
1996
IEEE
13 years 8 months ago
Partitionability of the Multistage Interconnection Networks
- Partitionability allows the creation of many physically independent subsystems, each of which retains an identical functionality as its parent network and has no communication in...
Yeimkuan Chang