Region-based memory management in cyclone

GrossmanDan,; MorrisettGreg,; JimTrevor,; HicksMichael,; WangYanling,; CheneyJames,

doi:10.1145/543552.512563

Cited by 85 publications

(94 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Region-based memory partitioning has been explored before in the context of safe and efficient memory management [30,59], but not for information flow. In ConfLLVM, regions obviate the need for dynamic taint tracking [39,51,55].…”

Section: Related Workmentioning

confidence: 99%

ConfLLVM

Brahmakshatriya

Kedia

McKee

et al. 2019

Proceedings of the Fourteenth EuroSys Conference 2019

View full text Add to dashboard Cite

We present a compiler-based scheme to protect the confidentiality of sensitive data in low-level applications (e.g. those written in C) in the presence of an active adversary. In our scheme, the programmer marks sensitive data by lightweight annotations on the top-level definitions in the source code. The compiler then uses a combination of static dataflow analysis, runtime instrumentation, and a novel taint-aware form of control-flow integrity to prevent data leaks even in the presence of low-level attacks. To reduce runtime overheads, the compiler uses a novel memory layout.We implement our scheme within the LLVM framework and evaluate it on the standard SPEC-CPU benchmarks, and on larger, real-world applications, including the NGINX webserver and the OpenLDAP directory server. We find that the performance overheads introduced by our instrumentation are moderate (average 12% on SPEC), and the programmer effort to port the applications is minimal.

show abstract

Section: Related Workmentioning

confidence: 99%

ConfLLVM

Brahmakshatriya

Kedia

McKee

et al. 2019

Proceedings of the Fourteenth EuroSys Conference 2019

View full text Add to dashboard Cite

show abstract

“…Previous work has leveraged type-safe languages [22] to build reliable and safe operating systems [34]. Spin [9] allowed applications to extend and optimize kernel performance by downloading modules written in Modula-3 [10].…”

Section: Related Workmentioning

confidence: 99%

Multiprogramming a 64kB Computer Safely and Efficiently

Levy

Campbell

Ghena

et al. 2017

Proceedings of the 26th Symposium on Operating Systems Principles

View full text Add to dashboard Cite

Low-power microcontrollers lack some of the hardware features and memory resources that enable multiprogrammable systems. Accordingly, microcontroller-based operating systems have not provided important features like fault isolation, dynamic memory allocation, and flexible concurrency. However, an emerging class of embedded applications are software platforms, rather than single purpose devices, and need these multiprogramming features. Tock, a new operating system for low-power platforms, takes advantage of limited hardwareprotection mechanisms as well as the type-safety features of the Rust programming language to provide a multiprogramming environment for microcontrollers. Tock isolates software faults, provides memory protection, and efficiently manages memory for dynamic application workloads written in any language. It achieves this while retaining the dependability requirements of long-running applications.

show abstract

“…The hypothesis that many objects, allocated in the same scope, share the same faith, i.e., have similar lifetimes has also been leveraged by many region-based memory management algorithms [1,4,9,15,19,20,23,24,26,28,35,46]. In such algorithms, objects with similar lifetime profiles are allocated in scope-based regions, which are deallocated as a whole when objects inside these regions are no longer reachable.…”

Section: Region-based Garbage Collectionmentioning

confidence: 99%

“…In such algorithms, objects with similar lifetime profiles are allocated in scope-based regions, which are deallocated as a whole when objects inside these regions are no longer reachable. However, existing region-based algorithms either require sophisticated static analysis [1,4,9,19,20,24] (which does not scale to large systems), heavily rely on manual code refactoring [23,46] (to guarantee that objects in the same region die approximately at the same time), or support only simple programming models [41,46,47] (such as parallel bag of tasks).…”

Section: Region-based Garbage Collectionmentioning

confidence: 99%

NG2C: pretenuring garbage collection with dynamic generations for HotSpot big data applications

Bruno

Oliveira²,

Ferreira

2017

Proceedings of the 2017 ACM SIGPLAN International Symposium on Memory Management

View full text Add to dashboard Cite

Big Data applications suffer from unpredictable and unacceptably high pause times due to Garbage Collection (GC). This is the case in latency-sensitive applications such as on-line credit-card fraud detection, graph-based computing for analysis on social networks, etc. Such pauses compromise latency requirements of the whole application stack and result from applications' aggressive buffering/caching of data, exposing an ill-suited GC design, which assumes that most objects will die young and does not consider that applications hold large amounts of middle-lived data in memory.To avoid such pauses, we propose NG2C, a new GC algorithm that combines pretenuring with an N-Generational heap. By being able to allocate objects into different generations, NG2C is able to group objects with similar lifetime profiles in the same generation. By allocating objects with similar lifetime profiles close to each other, i.e. in the same generation, we avoid object promotion (copying between generations) and heap fragmentation (which leads to heap compactions) both responsible for most of the duration of HotSpot GC pause times.NG2C is implemented for the OpenJDK 8 HotSpot Java Virtual Machine, as an extension of the Garbage First GC. We evaluate NG2C using Cassandra, Lucene, and GraphChi with three different GCs: Garbage First (G1), Concurrent Mark Sweep (CMS), and NG2C. Results show that NG2C decreases the worst observable GC pause time by up to 94.8% for Cassandra, 85.0% for Lucene and 96.45% for GraphChi, when compared to current collectors (G1 and CMS). In addition, NG2C has no negative impact on application throughput or memory usage.

show abstract

Region-based memory management in cyclone

Cited by 85 publications

References 24 publications

ConfLLVM

ConfLLVM

Multiprogramming a 64kB Computer Safely and Efficiently

NG2C: pretenuring garbage collection with dynamic generations for HotSpot big data applications

Contact Info

Product

Resources

About