2021
DOI: 10.1016/j.future.2020.07.044
|View full text |Cite
|
Sign up to set email alerts
|

An efficient shortest path algorithm for content-based routing on 2-D mesh accelerator networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…The k is set to 5. The comparison schemes are the shortest path algorithm(SPA) and the Shortest Cycle Routing Algorithm (SCRA) in 36 .…”
Section: Simulation Settingmentioning
confidence: 99%
“…The k is set to 5. The comparison schemes are the shortest path algorithm(SPA) and the Shortest Cycle Routing Algorithm (SCRA) in 36 .…”
Section: Simulation Settingmentioning
confidence: 99%