A New Topology with Odd Degree for Multiprocessor Systems |
| |
| Affiliation: | 1. School of Mathematics and Statistics, Xiamen University of Technology, Jimei, China;2. IRIF, CNRS & Université Paris Cité, Paris, France;3. Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan;1. College of Computer and Data Science, Fuzhou University, Fuzhou 350108, China;2. Institute of Information and Decision Sciences, National Taipei University of Business, Taipei 10051, Taiwan |
| |
| Abstract: | A new topology for interconnection networks has been proposed. The underlying network graph hasN= 4nnodes (n≥ 2) and isalmostregular with maximum degree 5 and diameter ≤ ?3/4 log2N? + 1. Algorithms for point-to-point routing and single node broadcast have also been developed. It has also been shown that various algorithms for real life applications, e.g., matrix transpose, matrix multiplication, finding the sum/average/maximum/minimum of a set of data elements and ASCEND/DESCEND types of algorithms can be efficiently implemented on this topology. Finally, the underlying idea of constructing this network has been generalized to define a family ofalmost regularodd degree graphs of maximum degree 2j+ 1, (j> 2) withN= (2j)nnodes and diameter ?3/4 logjN? + 1. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
