SYMMETRICAL DEGREE-4 CHORDAL RING NETWORKS

被引:14
|
作者
BROWNE, RF
HODGSON, RM
机构
来源
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES | 1990年 / 137卷 / 04期
关键词
D O I
10.1049/ip-e.1990.0038
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Techniques for analysing symmetric chordal ring networks of degree four are presented and expressions for the network diameter and the mean internode distance are derived. The network incorporates the maximum number of nodes for a given diameter, and has a communications cost, measured either as network diameter or as the mean internode distance, of O[√(N)]. Possible modifications to this network include breaking the ring to provide communications with a host computer, and a nonoptimal chordal displacement to allow a cellular array to be mapped onto the chordal ring. Such networks provide a practical means of networking processors such as the transputer, and the results presented in this paper have been verified on a network of transputers. The work originated from a study of the way in which the INMOS transputer could be best applied to image processing.
引用
收藏
页码:310 / 318
页数:9
相关论文
共 50 条
  • [31] A New Degree Six Modified Chordal Ring Network Topology
    Farah, R. N.
    Chien, S. L. E.
    Othman, M.
    ADVANCED SCIENCE LETTERS, 2017, 23 (06) : 5547 - 5550
  • [32] Compact routing on chordal rings of degree 4
    Narayanan, L
    Opatrny, J
    ALGORITHMICA, 1999, 23 (01) : 72 - 96
  • [33] Compact routing on chordal rings of degree 4
    Narayanan, L.
    Opatrny, J.
    Algorithmica (New York), 1999, 23 (01): : 72 - 96
  • [34] SOME NEW POLYHEDRA WITH VERTEX DEGREE-4 AND OR DEGREE-5 ONLY
    DUIJVESTIJN, AJW
    HELTHUIS, B
    MATHEMATICS OF COMPUTATION, 1990, 54 (190) : 749 - 753
  • [35] Compact Routing on Chordal Rings of Degree 4
    L. Narayanan
    J. Opatrny
    Algorithmica, 1999, 23 : 72 - 96
  • [36] Lifting Sum-of-Squares Lower Bounds: Degree-2 to Degree-4
    Mohanty, Sidhanth
    Raghavendra, Prasad
    Xu, Jeff
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 840 - 853
  • [37] A refined algorithm for maximum independent set in degree-4 graphs
    Xiao, Mingyu
    Nagamochi, Hiorshi
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (03) : 830 - 873
  • [38] Computing the degree-4 shortest network under a given topology
    Yinfeng X.
    Jichang Y.
    Zhu B.
    Discrete & Computational Geometry, 2000, 23 (3) : 437 - 448
  • [39] FUNDAMENTAL SYSTEMS OF UNITS IN CERTAIN FIELDS OF DEGREE-4 AND OF DEGREE-8 ON Q
    LEVESQUE, C
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1982, 34 (05): : 1059 - 1090
  • [40] TOTAL COLORING OF A MULTI-GRAPH WITH MAXIMAL DEGREE-4
    KOSTOCHKA, AV
    DISCRETE MATHEMATICS, 1977, 17 (02) : 161 - 163