Minimal diameter double-loop networks: Dense optimal families - Archive ouverte HAL Access content directly
Journal Articles Networks Year : 1991

Minimal diameter double-loop networks: Dense optimal families

(1) , (2)
1
2

Abstract

This article deals with the problem of minimizing the transmission delay in Illiac-type interconnection networks for parallel or distributed architectures or in local area networks. A double-loop networks (also known as circulant) G (n,h) consist of a loop of n vertices where each vertex i is also joined by chords to the vertices i +- h mod n. An integer n, a hop h, and a network (G(n,h) are called optimal if the diameter of G (n,h) is equal to the lower bound k when n E R [k] = (2k2 - 2K +2, ..., 2k2 + 2K+1). We determine new dense families of values of n that are optimal and such that the computation of the optimal hop is easy. These families cover almost all the elements of R[k] if k +1 is prime and cover 92% of all values of n up to 10(6).
Fichier principal
Vignette du fichier
78-BeTz91.pdf (2.47 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03013377 , version 1 (18-11-2020)

Identifiers

Cite

Jean-Claude Bermond, Dvora Tzvieli. Minimal diameter double-loop networks: Dense optimal families. Networks, 1991, 21 (1), pp.1-9. ⟨10.1002/net.3230210102⟩. ⟨hal-03013377⟩
33 View
45 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More