{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:46:33Z","timestamp":1777106793713,"version":"3.51.4"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Queue"],"published-print":{"date-parts":[[2015,9]]},"abstract":"<jats:p>Modern server-class systems are typically built as several multicore chips put together in a single system. Each chip has a local DRAM (dynamic random-access memory) module; together they are referred to as a node. Nodes are connected via a high-speed interconnect, and the system is fully coherent. This means that, transparently to the programmer, a core can issue requests to its node\u2019s local memory as well as to the memories of other nodes. The key distinction is that remote requests will take longer, because they are subject to longer wire delays and may have to jump several hops as they traverse the interconnect. The latency of memory-access times is hence non-uniform, because it depends on where the request originates and where it is destined to go. Such systems are referred to as NUMA (non-uniform memory access).<\/jats:p>","DOI":"10.1145\/2838344.2852078","type":"journal-article","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T04:37:22Z","timestamp":1599107842000},"page":"70-85","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Challenges of Memory Management on Modern NUMA System"],"prefix":"10.1145","volume":"13","author":[{"given":"Fabien","family":"Gaud","sequence":"first","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baptiste","family":"Lepers","sequence":"additional","affiliation":[{"name":"CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Funston","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Dashti","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Fedorova","sequence":"additional","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivien","family":"Qu\u00e9ma","sequence":"additional","affiliation":[{"name":"Grenoble INP"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renaud","family":"Lachaize","sequence":"additional","affiliation":[{"name":"UJF"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Roth","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,10,7]]},"reference":[{"key":"e_1_2_1_2_1","volume-title":"8th Usenix Symposium on Operating Systems and Design: 43-57","author":"Boyd-Wickizer S.","year":"2008"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1295480.1295481"},{"key":"e_1_2_1_4_1","unstructured":"Corbet J. 2012. AutoNUMA: the other approach to NUMA scheduling. LWN.net; http:\/\/lwn.net\/Articles\/488709\/.  Corbet J. 2012. AutoNUMA: the other approach to NUMA scheduling. LWN.net; http:\/\/lwn.net\/Articles\/488709\/."},{"key":"e_1_2_1_5_1","volume-title":"Evaluation of Face Recognition Algorithms","author":"Face Identification Evaluation System 0."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451157"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522714"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500468.2500477"},{"key":"e_1_2_1_9_1","unstructured":"Metis MapReduce Library; http:\/\/pdos.csail.mit.edu\/metis\/.  Metis MapReduce Library; http:\/\/pdos.csail.mit.edu\/metis\/."},{"key":"e_1_2_1_10_1","unstructured":"PARSEC Benchmark Suite; http:\/\/parsec.cs.princeton.edu\/.  PARSEC Benchmark Suite; http:\/\/parsec.cs.princeton.edu\/."}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2838344.2852078","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2838344.2852078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:30Z","timestamp":1750225410000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2838344.2852078"}},"subtitle":["Optimizing NUMA systems applications with Carrefour"],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["10.1145\/2838344.2852078"],"URL":"https:\/\/doi.org\/10.1145\/2838344.2852078","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"value":"1542-7730","type":"print"},{"value":"1542-7749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9]]},"assertion":[{"value":"2015-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}