|
|||||
|
|
Some properties and algorithms for the hyper-torus network |
|
| Authors: | Jong-Seok Kim Sung Won Kim Ke Qiu Hyeong-Ok Lee |
| Affiliation: | 1. Department of Computer Science, University of Rochester, Rochester, NY?, 14627, USA 2. Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, Gyeongbuk, 712-749, South Korea 3. Department of Computer science, Brock University, Saint Catharines, ON?, L2S 3A1, Canada 4. Department of Computer Education, Sunchon National University, Sunchon, Chonnam?, 540-742, South Korea |
| Abstract: | The hyper-torus network based on a three-dimensional hypercube was introduced recently. The hyper-torus \(QT(m,n)\) performs better than mesh type networks with a similar number of nodes in terms of the network cost. In this paper, we prove that if \(n\) is even, the bisection width of \(QT(m,n)\) is \(6n\) , whereas it is \(6n+2\) if it is odd. Second, we show that \(QT(m,n)\) contains a Hamiltonian cycle. In addition, its one-to-all and all-to-all broadcasting algorithms are introduced. All of these broadcasting algorithms are asymptotically optimal. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |