Proceedings of the 3rd International Workshop on Many-Core Embedded Systems 2015
DOI: 10.1145/2768177.2768180
|View full text |Cite
|
Sign up to set email alerts
|

Improved Route Selection Approaches using Q-learning framework for 2D NoCs

Abstract: With the emergence of large multi-core architectures, a volume of research has been focused on distributing traffic evenly over the whole network. However, increase in traffic density may lead to congestion and subsequently degrade the performance by increased latency in the network. In this paper, we propose two novel route selection strategies for on-chip networks which are based on the Q-learning framework. The proposed strategies use variable learning rate to dynamically capture the current congestion stat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 14 publications
(23 reference statements)
0
5
0
Order By: Relevance
“…The Q-value represents latency to reach destination d with router y, and the algorithm has to select router y with the lowest Q-value(or latency). An improvement of QCA as Credencebased-Q-routing & Probabilistic-Credence-based-Q-routing is proposed by Gupta et al [49]. It uses credence as a c-value to measure Q-value and makes the learning rate vary with the time that improves the learning process.…”
Section: ) Table Based -Using Table Entriesmentioning
confidence: 99%
“…The Q-value represents latency to reach destination d with router y, and the algorithm has to select router y with the lowest Q-value(or latency). An improvement of QCA as Credencebased-Q-routing & Probabilistic-Credence-based-Q-routing is proposed by Gupta et al [49]. It uses credence as a c-value to measure Q-value and makes the learning rate vary with the time that improves the learning process.…”
Section: ) Table Based -Using Table Entriesmentioning
confidence: 99%
“…Two improved versions of Q-routing, namely Credencebased Q-routing (CrQ-Routing) and Probabilistic Credence-based Q-routing (PCrQ-Routing), are proposed in [23] to capture the traffic congestion dynamically and to improve the learning process to select less congested paths. CrQ-Routing uses variable learning rates based on the inferred confidence to make the Q-value updates more efficient.…”
Section: A Prior Workmentioning
confidence: 99%
“…However, Q-Routing does not always guarantee finding the shortest path and does not explore multiple forwarding options in parallel. • Credence-based Q-Routing (CrQ-Routing) and Probabilistic Credence-based Q-Routing (PCrQ-Routing) [215]: These two methods dynamically capture the traffic congestion to improve the learning process to select less congested paths. Both methods adapt to the current network conditions much faster than the conventional Q-Routing.…”
Section: B Ai-enabled Routing Protocolsmentioning
confidence: 99%