Routing Method Based on the Excess Code for Fault Tolerant Clusters with InfiniBand

Goncharenko, Olexandr; Rehida, Pavlo; Volokyta, Artem; Loutskii, Heorhii; Thinh, Vu Duc

doi:10.1007/978-3-030-16621-2_31

Search citation statements

Order By: Relevance

Paper Sections

Select...

Excess De Bruijn As the Basis Of Multilevel Structure1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2022

Publication Types

Select...

Book2

Other2

Article1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This topology is an extension of the usual de Bruijn topology [7][8][9][10] using a redundant binary representation for nodes encoding [11][12][13][14][15][16]. The link system forms by operations of code shift, as the result, the degree of this graph is constant and independent from its rank.…”

Section: Excess De Bruijn As the Basis Of Multilevel Structurementioning

confidence: 99%

Extended DragonDeBrujin Topology Synthesis Method

Volokyta¹,

Loutskii²,

Rehida³

et al. 2022

IJCNIS

View full text Add to dashboard Cite

Scaling high performance computer systems needs increasing the fault tolerance at the design stage of a topology. There are several approaches of designing simple fast routing with fault tolerance. One of effective approach is to ensure fault tolerance at the topology level. This article discusses two methods for optimizing topologies synthesized using Dragonfly and Excess De Brujin. Methods of topology saturation are discusses, which allow to increase the dimension of the system without deterioration of topological characteristics due to the optimization of the synthesis method. Three scaling constraint methods are also proposed to reduce the topology dimension to the desired performance.

show abstract