Improved upper and lower bounds on the optimization of mixed chordal ring networks |
| |
Authors: | James K Lan |
| |
Affiliation: | a Department of Applied Mathematics, National Chiao Tung University, Hsinchu 300, Taiwan b Department of Electrical & Computer Engineering, The State University of New York at Stony Brook, Stony Brook, NY 11794, USA |
| |
Abstract: | Recently, Chen, Hwang and Liu S.K. Chen, F.K. Hwang, Y.C. Liu, Some combinatorial properties of mixed chordal rings, J. Interconnection Networks 1 (2003) 3-16] introduced the mixed chordal ring network as a topology for interconnection networks. In particular, they showed that the amount of hardware and the network structure of the mixed chordal ring network are very comparable to the (directed) double-loop network, yet the mixed chordal ring network can achieve a better diameter than the double-loop network. More precisely, the mixed chordal ring network can achieve diameter about as compared to for the (directed) double-loop network, where N is the number of nodes in the network. One of the most important questions in interconnection networks is, for a given number of nodes, how to find an optimal network (a network with the smallest diameter) and give the construction of such a network. Chen et al. S.K. Chen, F.K. Hwang, Y.C. Liu, Some combinatorial properties of mixed chordal rings, J. Interconnection Networks 1 (2003) 3-16] gave upper and lower bounds for such an optimization problem on the mixed chordal ring network. In this paper, we improve the upper and lower bounds as and , respectively. In addition, we correct some deficient contexts in S.K. Chen, F.K. Hwang, Y.C. Liu, Some combinatorial properties of mixed chordal rings, J. Interconnection Networks 1 (2003) 3-16]. |
| |
Keywords: | Optimization Diameter Double-loop network Mixed chordal ring network Interconnection network Parallel processing Ring Loop |
本文献已被 ScienceDirect 等数据库收录! |
|