skip to main content
research-article
Free Access

An overview of non-uniform memory access

Published:01 September 2013Publication History
Skip Abstract Section

Abstract

NUMA becomes more common because memory controllers get close to execution units on microprocessors.

References

  1. Braithwaite, R., McCormick, P., Feng, W. Empirical memory-access cost models in multicore NUMA architectures. Virginia Tech Department of Computer Science, 2011.Google ScholarGoogle Scholar
  2. Hacker, G. Using NUMA on RHEL 6; http://www.redhat. com/summit/2012/pdf/2012-DevDay-Lab-NUMA-Hacker.pdf.Google ScholarGoogle Scholar
  3. Kleen, A. A NUMA API for Linux. Novell, 2005; http://developer.amd.com/wordpress/ media/2012/10/LibNUMA-WP-fv1.pdf.Google ScholarGoogle Scholar
  4. Lameter, C. Effective synchronization on Linux/NUMA systems. Gelato Conference, 2005. Effective synchronization on Linux/NUMA systems. Gelato Conference, 2005.Google ScholarGoogle Scholar
  5. Lameter, C. 2006. Remote and local memory: Memory in a Linux/NUMA system. Gelato Conference, 2006.Google ScholarGoogle Scholar
  6. Li, Y., Pandis, I., Mueller, R., Raman, V., Lohman, G. NUMA-aware algorithms: The case of data shuffling. University of Wisconsin-Madison / IBM Almaden Research Center, 2013.Google ScholarGoogle Scholar
  7. Love, R. 2004. Linux Kernel Development. Indianapolis: Sams Publishing. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Oracle. Memory and Thread Placement Optimization Developer's Guide, 2010; http://docs.oracle.com/cd/E19963-01/ html/820-1691/.Google ScholarGoogle Scholar
  9. Schimmel, K. Unix Systems for Modern Architectures: Symmetric Multiprocessing and Caching for Kernel Programmers. Addison-Wesley, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An overview of non-uniform memory access

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 56, Issue 9
          September 2013
          97 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/2500468
          Issue’s Table of Contents

          Copyright © 2013 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 September 2013

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Popular
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format