Sciweavers

13 search results - page 2 / 3
» On the genus of pancake network
Sort
View
IPPS
1993
IEEE
13 years 9 months ago
Mapping Interconnection Networks into VEDIC Networks
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
Vipin Chaudhary, Bikash Sabata, Jake K. Aggarwal
DC
2010
13 years 4 months ago
Towards worst-case churn resistant peer-to-peer systems
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
ISPAN
1999
IEEE
13 years 9 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
ISPAN
1997
IEEE
13 years 9 months ago
On The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
Douglas W. Bass, Ivan Hal Sudborough
STACS
2007
Springer
13 years 11 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald