A Case for Software-based Adaptive Routing in NUMA systems

Cited 1 time in webofscience Cited 1 time in scopus
  • Hit : 201
  • Download : 0
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 softwarebased 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.
Publisher
IEEE
Issue Date
2019-11-20
Language
English
Citation

37th IEEE International Conference on Computer Design, pp.684 - 693

DOI
10.1109/ICCD46524.2019.00100
URI
http://hdl.handle.net/10203/268961
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0