ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 A Case for Software-based Adaptive Routing in NUMA Systems
Cited 1 time in scopus Download 6 time Share share facebook twitter linkedin kakaostory
저자
송원준, 김동준
발행일
201911
출처
International Conference on Computer Design (ICCD) 2019, pp.684-693
DOI
https://dx.doi.org/10.1109/ICCD46524.2019.00100
협약과제
18JH1300, 원전 계측제어 사이버보안 취약점 점검 기술, 최양서
초록
Memory placement in NUMA systems has a significant impact on overall performance; however, most prior work has not considered the performance impact of NUMA interconnect as a deterministic routing have been used to access a remote memory. In this work, we propose adaptive routing in NUMA interconnect to exploit path diversity in NUMA systems. In particular, we propose a software-based adaptive routing where packet routing paths are changed by modifying the routing table dynamically during runtime - thus, reducing interconnect channel contention and improving overall performance. Adaptive routing does not minimize memory contention but since the interconnect channel can be shared by multiple NUMA nodes and creates contention, adaptive routing maximizes the interconnect bandwidth by load-balancing traffic across different interconnect channels. We provide a proof-of-concept implementation of software-based adaptive routing on AMD Hypertransport-based system and demonstrate performance benefits, including how it is orthogonal to thread and memory schedulers and complements existing OS (or NUMA) schedulers.
키워드
Adaptive routing, Interconnect, NUMA
KSP 제안 키워드
Adaptive routing, Channel contention, Load balancing, NUMA Systems, Overall performance, Packet routing, Path diversity, Performance impact, Remote Memory, Routing Path, Routing table