Search: onr:"swepub:oai:DiVA.org:kth-186848" >
Achieving memory ac...
Achieving memory access equalization via round-trip routing latency prediction in 3D many-core NoCs
- Article/chapterEnglish2015
Publisher, publication year, extent ...
-
IEEE,2015
-
printrdacarrier
Numbers
-
LIBRIS-ID:oai:DiVA.org:kth-186848
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186848URI
-
https://doi.org/10.1109/ISVLSI.2015.8DOI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:ref swepub-contenttype
-
Subject category:kon swepub-publicationtype
Notes
-
QC 20160517
-
3D many-core NoCs are emerging architectures for future high-performance single chips due to its integration of many processor cores and memories by stacking multiple layers. In such architecture, because processor cores and memories reside in different locations (center, corner, edge, etc.), memory accesses behave differently due to their different communication distances, and the performance (latency) gap of different memory accesses becomes larger as the network size is scaled up. This phenomenon may lead to very high latencies suffered from by some memory accesses, thus degrading the system performance. To achieve high performance, it is crucial to reduce the number of memory accesses with very high latencies. However, this should be done with care since shortening the latency of one memory access can worsen the latency of another as a result of shared network resources. Therefore, the goal should focus on narrowing the latency difference of memory accesses. In the paper, we address the goal by proposing to prioritize the memory access packets based on predicting the round-trip routing latencies of memory accesses. The communication distance and the number of the occupied items in the buffers in the remaining routing path are used to predict the round-trip latency of a memory access. The predicted round-trip routing latency is used as the base to arbitrate the memory access packets so that the memory access with potential high latency can be transferred as early and fast as possible, thus equalizing the memory access latencies as much as possible. Experiments with varied network sizes and packet injection rates prove that our approach can achieve the goal of memory access equalization and outperforms the classic round-robin arbitration in terms of maximum latency, average latency, and LSD1. In the experiments, the maximum improvement of the maximum latency, the average latency and the LSD are 80%, 14%, and 45% respectively.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Lu, ZhonghaiKTH,Elektronik och Inbyggda System(Swepub:kth)u1wqy6h0
(author)
-
Li, Y.
(author)
-
Jantsch, A.
(author)
-
Zhao, XueqianKTH,Elektronik och Inbyggda System(Swepub:kth)u1wrj21t
(author)
-
Chen, S.
(author)
-
Guo, Y.
(author)
-
Liu, Z.
(author)
-
Lu, J.
(author)
-
Wan, J.
(author)
-
Sun, S.
(author)
-
Chen, H.
(author)
-
KTHElektronik och Inbyggda System
(creator_code:org_t)
Related titles
-
In:Proceedings of IEEE Computer Society Annual Symposium on VLSI, ISVLSI: IEEE, s. 398-403
Internet link
To the university's database
- By the author/editor
-
Chen, X.
-
Lu, Zhonghai
-
Li, Y.
-
Jantsch, A.
-
Zhao, Xueqian
-
Chen, S.
-
show more...
-
Guo, Y.
-
Liu, Z.
-
Lu, J.
-
Wan, J.
-
Sun, S.
-
Chen, H.
-
show less...
- About the subject
-
- ENGINEERING AND TECHNOLOGY
-
ENGINEERING AND ...
-
and Electrical Engin ...
-
and Computer Systems
- Articles in the publication
- Proceedings of I ...
- By the university
-
Royal Institute of Technology