HIGHLIGHTS
- who: . et al. from the Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia HSE University, Moscow, Russia have published the Article: Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies, in the Journal: (JOURNAL)
- what: To solve the problem of the set of the shortest path search and developing a fault-tolerant routing algorithm, the authors propose a modification of the breadth-first search (BFS) algorithm . The authors show that due to the commutativity property in a circulant of any dimension when a node (or a communication . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.