2018 IEEE 26th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM) 2018
DOI: 10.1109/fccm.2018.00013
|View full text |Cite
|
Sign up to set email alerts
|

A Bandwidth-Optimized Routing Algorithm for Hybrid FPGA Networks-on-Chip

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…During the path selection step, they use a backtracking algorithm to explore the path diversity and during the slot allocation step, path-overlapped VCs must be configured such that no conflict occurs and their bandwidth requirements are satisfied. In [29], Patil et al utilize a multi-iteration routing algorithm to combine path and time slot selection in a single pass. Instead of the dimension-ordered routing, their approach takes any available shortest path from source to destination and uses multiple rip-up and reroute passes to eliminate the effects of network ordering.…”
Section: Tdm Routing Algorithmmentioning
confidence: 99%
“…During the path selection step, they use a backtracking algorithm to explore the path diversity and during the slot allocation step, path-overlapped VCs must be configured such that no conflict occurs and their bandwidth requirements are satisfied. In [29], Patil et al utilize a multi-iteration routing algorithm to combine path and time slot selection in a single pass. Instead of the dimension-ordered routing, their approach takes any available shortest path from source to destination and uses multiple rip-up and reroute passes to eliminate the effects of network ordering.…”
Section: Tdm Routing Algorithmmentioning
confidence: 99%
“…This routing algorithm can reduce total wire-length and increase the maximum clock frequency at the same time. Wang et al propose a new approach [15] based on the PathFinder algorithm. They only reroute illegal paths during each routing iteration and can reduce 68.5% routing runtime on average.…”
Section: Related Workmentioning
confidence: 99%