Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bennett Cooper

dblp:371/9336 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0003-0375-9418ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 64% GPUs and heterogeneous computing · 18% Performance modeling and evaluation · 18%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › virtual memory management
demand paging
0.812024
Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory · ACM Trans. Archit. Code Optim. 2024
Memory systems
memory access patterns
0.812024
Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory · ACM Trans. Archit. Code Optim. 2024
Memory systems › memory management › virtual memory
page fault handling
0.812024
Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory · ACM Trans. Archit. Code Optim. 2024
GPUs and heterogeneous computing › GPU memory management
unified virtual memory
0.812024
Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory · ACM Trans. Archit. Code Optim. 2024
Performance modeling and evaluation
workload characterization
0.812024
Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory · ACM Trans. Archit. Code Optim. 2024
Memory systems › memory management
heterogeneous memory management
0.212024
Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory · ACM Trans. Archit. Code Optim. 2024
Memory systems › memory management
virtual memory
0.212024
Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory · ACM Trans. Archit. Code Optim. 2024

Methods — techniques the papers use, named apart from their topics

quantitative batch analysis · 0.8performance profiling · 0.8
YearPublicationVenuePosition
2026 Enhanced SVM for Improving Application Performance Under GPU Memory Oversubscription
Bennett Cooper, Thomas Scogland, Rong Ge 0002
CCGrid1
2024 Shared Virtual Memory: Its Design and Performance Implications for Diverse Applications
abstract
Discrete GPU accelerators, while providing massive computing power for supercomputers and data centers, have their separate memory domain. Explicit memory management across device and host domains in programming is tedious and error-prone. To improve programming portability and productivity, Unified Memory (UM) integrates GPU memory into the host virtual memory systems, and provides transparent data migration between them and GPU memory oversubscription. Nevertheless, current UM technologies cause significant performance loss for applications. With AMD GPUs increasingly being integrated into the world’s leading supercomputers, it is necessary to understand their Shared Virtual Memory (SVM) and mitigate the performance impacts. In this work, we delve into the SVM design, examine its interactions with applications’ data accesses at fine granularity, and quantitatively analyze its performance effects on various applications and identify the performance bottlenecks. Our research reveals that SVM employs an aggressive prefetching strategy for demand paging. This prefetching is efficient when GPU memory is not oversubscribed. However, in tandem with the eviction policy, it causes excessive thrashing and performance degradation for certain applications under oversubscription. We discuss SVM-aware algorithms and SVM design changes to mitigate the performance impacts. To the best of our knowledge, this work is the first in-depth and comprehensive study for SVM technologies.
Bennett Cooper, Thomas Scogland, Rong Ge 0002
ICS1
2024 Fine-grain Quantitative Analysis of Demand Paging in Unified Virtual Memory
abstract
The abstraction of a shared memory space over separate CPU and GPU memory domains has eased the burden of portability for many HPC codebases. However, users pay for ease of use provided by system-managed memory with a moderate-to-high performance overhead. NVIDIA Unified Virtual Memory (UVM) is currently the primary real-world implementation of such abstraction and offers a functionally equivalent testbed for in-depth performance study for both UVM and future Linux Heterogeneous Memory Management (HMM) compatible systems. The continued advocacy for UVM and HMM motivates improvement of the underlying system. We focus on UVM-based systems and investigate the root causes of UVM overhead, a non-trivial task due to complex interactions of multiple hardware and software constituents and the desired cost granularity. In our prior work, we delved deeply into UVM system architecture and showed internal behaviors of page fault servicing in batches. We provided quantitative evaluation of batch handling for various applications under different scenarios, including prefetching and oversubscription. We revealed that the driver workload depends on the interactions among application access patterns, GPU hardware constraints, and host OS components. Host OS components have significant overhead present across implementations, warranting close attention. This extension furthers our prior study in three aspects: fine-grain cost analysis and breakdown, extension to multiple GPUs, and investigation of platforms with different GPU-GPU interconnects. We take a top-down approach to quantitative batch analysis and uncover how constituent component costs accumulate and overlap, governed by synchronous and asynchronous operations. Our multi-GPU analysis shows reduced cost of GPU-GPU batch workloads compared to CPU-GPU workloads. We further demonstrate that while specialized interconnects, NVLink, can improve batch cost, their benefits are limited by host OS software overhead and GPU oversubscription. This study serves as a proxy for future shared memory systems, such as those that interface with HMM, and the development of interconnects.
Tyler N. Allen, Bennett Cooper, Rong Ge 0002
ACM Trans. Archit. Code Optim.2