Sciweavers

332 search results - page 26 / 67
» Hypercubic Sorting Networks
Sort
View
SIROCCO
2007
14 years 11 months ago
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
Rastislav Kralovic, Richard Královic
ICPP
1992
IEEE
15 years 1 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
77
Voted
IPPS
1997
IEEE
15 years 1 months ago
An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing
We present a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n-cubes. Through the analysis of network flows, our methodology furni...
Bruno Ciciani, Claudio Paolucci, Michele Colajanni
OPODIS
2010
14 years 7 months ago
SkewCCC+: A Heterogeneous Distributed Hash Table
Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that conside...
Marcin Bienkowski, André Brinkmann, Marek K...
ISPAN
1999
IEEE
15 years 1 months ago
Sparse Networks Tolerating Random Faults
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
Toshinori Yamada, Shuichi Ueno