Routing in circulant graphs based on a virtual coordinate system
This article explores routing methods in two-dimensional circulant graphs where each vertex is linked to four neighboring ones. The unique symmetries of the circulant graph make it a viable topology for high-performance computing devices, such as networks-on-chip and cluster supercomputers. It was s...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Kazan Federal University
2024-01-01
|
| Rangatū: | Учёные записки Казанского университета: Серия Физико-математические науки |
| Ngā marau: | |
| Urunga tuihono: | https://uzakufismat.elpub.ru/jour/article/view/16 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|