Sciweavers

332 search results - page 32 / 67
» Hypercubic Sorting Networks
Sort
View
APCSAC
2005
IEEE
14 years 1 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
GLOBECOM
2008
IEEE
14 years 2 months ago
On Spectrum Sharing in Cooperative Multiple Access Networks
Abstract— The coexistence and resource sharing between a primary network utilizing cognitive relays and a secondary network are investigated. Two multiple access protocols are pr...
Amr El-Sherif, Ahmed K. Sadek, K. J. Ray Liu
IPPS
2006
IEEE
14 years 1 months ago
Topology-aware task mapping for reducing communication contention on large parallel machines
Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies ...
T. Agarwal, Amit Sharma, A. Laxmikant, Laxmikant V...
ISCC
2005
IEEE
14 years 1 months ago
Degree-Optimal Deterministic Routing for P2P Systems
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
IPPS
1997
IEEE
13 years 12 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya