Sciweavers

13 search results - page 1 / 3
» Dual of a Complete Graph as an Interconnection Network
Sort
View
80
Voted
JPDC
2000
106views more  JPDC 2000»
14 years 9 months ago
Dual of a Complete Graph as an Interconnection Network
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
Si-Qing Zheng, Jie Wu
IEEECIT
2010
IEEE
14 years 8 months ago
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...
Yamin Li, Shietung Peng, Wanming Chu
92
Voted
APPT
2009
Springer
14 years 7 months ago
The Recursive Dual-Net and Its Applications
Abstract. In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel...
Yamin Li, Shietung Peng, Wanming Chu
IEEECIT
2009
IEEE
14 years 7 months ago
Hamiltonian Connectedness of Recursive Dual-Net
Recursive Dual-Net (RDN) was proposed recently as an effective, high-performance interconnection network for supercomputers with millions of nodes. A Recursive DualNet RDN(B) is r...
Yamin Li, Shietung Peng, Wanming Chu
69
Voted
NIPS
1996
14 years 10 months ago
Are Hopfield Networks Faster than Conventional Computers?
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
Ian Parberry, Hung-Li Tseng