Sciweavers

38 search results - page 7 / 8
» Hamiltonian fault-tolerance of hypercubes
Sort
View
COCOON
2004
Springer
14 years 22 days ago
Fault Hamiltonicity of Meshes with Two Wraparound Edges
We consider the fault hamiltonian properties of m×n meshes with two wraparound edges in the first row and the last row, denoted by M2(m, n), m ≥ 2, n ≥ 3. M2(m, n) is a spann...
Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park,...
DC
2010
13 years 7 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
TCS
2002
13 years 7 months ago
Some permutation routing algorithms for low-dimensional hypercubes
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
Frank K. Hwang, Y. C. Yao, Bhaskar DasGupta
IPPS
2005
IEEE
14 years 28 days ago
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
Multicast applications for large-scale Mobile Ad hoc NETworks (MANETs) require an efficient and effective Quality of Service (QoS)-aware multicast model. The new requirements to ...
Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C. C...
TJS
2010
89views more  TJS 2010»
13 years 5 months ago
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks in such supercomputers play an important role for achi...
Yamin Li, Shietung Peng, Wanming Chu