Round-trip DRAM access fairness in 3D NoC-based many-core systems

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: WFRF:(Lu Zhonghai) > Round-trip DRAM acc...

Chen, XiaowenKTH,Skolan för elektro- och systemteknik (EES) (författare)

Round-trip DRAM access fairness in 3D NoC-based many-core systems

Artikel/kapitelEngelska2017

Förlag, utgivningsår, omfång ...

2017-09-27
Association for Computing Machinery,2017
printrdacarrier

Nummerbeteckningar

LIBRIS-ID:oai:DiVA.org:kth-216205
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-216205URI
https://doi.org/10.1145/3126561DOI

Kompletterande språkuppgifter

Språk:engelska
Sammanfattning på:engelska

Ingår i deldatabas

SwePubSwePub

Klassifikation

Ämneskategori:ref swepub-contenttype
Ämneskategori:art swepub-publicationtype

Anmärkningar

QC 20171218
In 3D NoC-based many-core systems, DRAM accesses behave differently due to their different communication distances and the latency gap of different DRAM accesses becomes bigger as the network size increases, which leads to unfair DRAM access performance among different nodes. This phenomenon may lead to high latencies for some DRAM accesses that become the performance bottleneck of the system. The paper addresses the DRAM access fairness problem in 3D NoC-based many-core systems by narrowing the latency difference of DRAM accesses as well as reducing the maximum latency. Firstly, the latency of a round-trip DRAM access is modeled and the factors causing DRAM access latency difference are discussed in detail. Secondly, the DRAM access fairness is further quantitatively analyzed through experiments. Thirdly, we propose to predict the network latency of round-trip DRAM accesses and use the predicted round-trip DRAM access time as the basis to prioritize the DRAM accesses in DRAM interfaces so that the DRAM accesses with potential high latencies can be transferred as early and fast as possible, thus achieving fair DRAM access. Experiments with synthetic and application workloads validate that our approach can achieve fair DRAM access and outperform the traditional First-Come-First-Serve (FCFS) scheduling policy and the scheduling policies proposed by reference [7] and [24] in terms of maximum latency, Latency Standard Deviation (LSD)1 and speedup. In the experiments, the maximum improvement of the maximum latency, LSD, and speedup are 12.8%, 6.57%, and 8.3% respectively. Besides, our proposal brings very small extra hardware overhead (<0.6%) in comparison to the three counterparts.

Ämnesord och genrebeteckningar

NATURVETENSKAP Data- och informationsvetenskap Datorteknik hsv//swe
NATURAL SCIENCES Computer and Information Sciences Computer Engineering hsv//eng
3D networks-on-chip (NoC)
DRAM access fairness
DRAM scheduling
Round-trip
Scheduling
3D networks
Communication distance
First come first serves
Hardware overheads
Performance bottlenecks
Round trip
Scheduling policies
Standard deviation
Network-on-chip

Biuppslag (personer, institutioner, konferenser, titlar ...)

Lu, ZhonghaiKTH,VinnExcellence Center for Intelligence in Paper and Packaging, iPACK,Elektronik(Swepub:kth)u1wqy6h0 (författare)
Liu, S. (författare)
Chen, S. (författare)
KTHSkolan för elektro- och systemteknik (EES) (creator_code:org_t)

Sammanhörande titlar

Ingår i:ACM Transactions on Embedded Computing Systems: Association for Computing Machinery16:5s1539-90871558-3465

Internetlänk

Hitta via bibliotek

ACM Transactions on Embedded Computing Systems (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: Chen, Xiaowen; Lu, Zhonghai; Liu, S.; Chen, S.

Om ämnet

NATURVETENSKAP: NATURVETENSKAP; och Data och informa ...; och Datorteknik

Artiklar i publikationen: ACM Transactions ...

Av lärosätet: Kungliga Tekniska Högskolan

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se