Home
Resource
Architectural support for virtual memory in GPUs
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(1.30 MB)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Pichai, Bharath. Architectural support for virtual memory in GPUs. Retrieved from https://doi.org/doi:10.7282/T33F4MPF

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleArchitectural support for virtual memory in GPUs
NamePichai, Bharath (author); Bhattacharjee, Abhishek (chair); Bianchini, Ricardo (internal member); Nguyen, Thu (internal member); Rutgers University; Graduate School - New Brunswick
Date Created2013
Other Date2013-10 (degree)
SubjectComputer Science, Computer architecture, Computer storage devices, Graphics processing units
Extentix, 43 p. : ill.
DescriptionThe proliferation of heterogeneous compute platforms, of which CPU/GPU is a prevalent example, necessitates a manageable programming model to ensure widespread adoption. A key component of this is a shared unified address space between the heterogeneous units to obtain the programmability benefits of virtual memory. Indeed, processor vendors have already begun embracing heterogeneous systems with unified address spaces (e.g., Intel's Haswell, AMD's Berlin processor, and ARM's Mali and Cortex cores). We are the first to explore GPU Translation Lookaside Buffers (TLBs) and page table walkers for address translation in the context of shared virtual memory for heterogeneous systems. To exploit the programmability benefits of shared virtual memory, it is natural to consider mirroring CPUs and placing TLBs prior (or parallel) to cache accesses, making caches physically addressed. We show the performance challenges of such an approach and propose modest hardware augmentations to recover much of this lost performance. We then consider the impact of this approach on the design of general purpose GPU performance improvement schemes. We look at: (1) warp scheduling to increase cache hit rates; and (2) dynamic warp formation to mitigate control flow divergence overheads. We show that introducing cache-parallel address translation does pose challenges, but that modest optimizations can buy back much of this lost performance. In the CPU world, the programmability benefits of address translation and physically addressed caches have outweighed their performance overheads. This paper is the first to explore similar address translation mechanisms on GPUs. We find that while cache-parallel address translation does introduce non-trivial performance overheads, modestly TLB-aware designs can move performance losses into a range deemed acceptable in the CPU world. We presume this stake-in-the-ground design leaves room for improvement but hope the larger result, that a little TLB-awareness goes a long way in GPUs, sets the stage for future work in this fruitful area.
NoteM.S.
NoteIncludes bibliographical references
Noteby Bharath Subramanian Pichai
Genretheses, ETD graduate
Persistent URLhttps://doi.org/doi:10.7282/T33F4MPF
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024