Reliability-aware Garbage Collection for Hybrid HBM-DRAM Memories

نویسندگان

چکیده

Emerging workloads in cloud and data center infrastructures demand high main memory bandwidth capacity. Unfortunately, DRAM alone is unable to satisfy contemporary demands. High-bandwidth (HBM) uses 3D die-stacking deliver 4–8× higher bandwidth. HBM has two drawbacks: (1) capacity low, (2) soft error rate high. Hybrid combines promise low fault rates, bandwidth, Prior OS approaches manage by mapping pages versus based on hotness (access frequency) risk (susceptibility errors). these operate at a coarse-grained page granularity, frequent migrations hurt performance. This article proposes new class of reliability-aware garbage collectors for hybrid HBM-DRAM systems that place hot low-risk objects the rest DRAM. Our analysis nine real-world Java shows that: newly allocated nursery are frequently written, making them both low-risk, small fraction mature (3) allocation site good predictor risk. We propose RiskRelief, novel collector prediction HBM. Allocation sites profiled offline RiskRelief heuristics classify as The proposed expose Pareto-optimal trade-offs between (SER) execution time. improves SER 9× compared an HBM-Only system while same time improving performance 29% DRAM-Only system. Compared state-of-the-art approach placement, eliminates all migration overheads, which substantially delivering similar SER. Reliability-aware collection opens up opportunity emerging memories fine granularity requiring no extra hardware support leaving programming model unchanged.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Garbage Collection Should Be Lifetime Aware

We argue that garbage collection should be more closely tied to object demographics. We show that this behaviour is sufficiently distinctive to make exploitation feasible and describe a novel GC framework that exploits object lifetime analysis yet tolerates imprecision. We argue for future collectors based on combinations of approximate analyses and dynamic sampling.

متن کامل

Locality-Aware Many-Core Garbage Collection

The wide-scale deployment of multi-core and many-core processors will necessitate fundamental changes to garbage collectors. Highly parallel garbage collection is critical to the performance of these systems — today’s garbage collectors can quickly become the bottleneck for parallel programs. These processors will present additional new challenges — many contain non-uniform memory architectures...

متن کامل

Framework for Analyzing Garbage Collection

While the design of garbage collection algorithms has come of age, the analysis of these algorithms is still in its infancy. Current analyses are limited to merely documenting costs of individual collector executions; conclusive results, measuring across entire programs, require a theoretical foundation from which proofs can be offered. A theoretical foundation also allows abstract examination ...

متن کامل

Garbage Collection for Control Systems

This paper describes a scheme for garbage collection suitable for hard real-time applications. The approach supports both periodic high-priority processes and low-priority processes. Garbage collection work is done exclusively during execution of low-priority processes. A prototype garbage collector has been implemented for a C++ real-time kernel. The results confirms that high-priority process...

متن کامل

Providing hints for garbage collection

This paper presents a mechanism that uses off-line profile information to examine when garbage is best collected. This information is then used to guide the garbage collection frequency in order to reduce the garbage collection time and total execution time. Keywords—Java, garbage collection, scheduling

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Architecture and Code Optimization

سال: 2021

ISSN: ['1544-3973', '1544-3566']

DOI: https://doi.org/10.1145/3431803