Sizing multi-space in heap for application isolation

Sun, Kai; Liu, Ying; Hogstrom, Matt; Chen, Ying

doi:10.1145/1176617.1176654

“…Sun et al [31] consider the problem of a single Java application server that has isolated, per-application heaplets within a single JVM. Each heaplet's size can be set independently.…”

Section: Mathematical Models For Heap Managementmentioning

confidence: 99%

Control theory for principled heap sizing

White¹,

Singer²,

Aitken³

et al. 2013

Proceedings of the 2013 International Symposium on Memory Management

View full text Add to dashboard Cite

We propose a new, principled approach to adaptive heap sizing based on control theory. We review current state-of-the-art heap sizing mechanisms, as deployed in Jikes RVM and HotSpot. We then formulate heap sizing as a control problem, apply and tune a standard controller algorithm, and evaluate its performance on a set of well-known benchmarks. We find our controller adapts the heap size more responsively than existing mechanisms. This responsiveness allows tighter virtual machine memory footprints while preserving target application throughput, which is ideal for both embedded and utility computing domains. In short, we argue that formal, systematic approaches to memory management should be replacing ad-hoc heuristics as the discipline matures. Controltheoretic heap sizing is one such systematic approach.

show abstract

Security issues in cloud environments: a survey

Fernandes

¹

,

Soares

²

,

Gomes

³

et al. 2013

Int. J. Inf. Secur.

View full text Add to dashboard Cite

Control theory for principled heap sizing

White

¹

,

Singer

²

,

Aitken

³

et al. 2013

Proceedings of the 2013 International Symposium on Memory Management

3

0

View full text Add to dashboard Cite

We propose a new, principled approach to adaptive heap sizing based on control theory. We review current state-of-the-art heap sizing mechanisms, as deployed in Jikes RVM and HotSpot. We then formulate heap sizing as a control problem, apply and tune a standard controller algorithm, and evaluate its performance on a set of well-known benchmarks. We find our controller adapts the heap size more responsively than existing mechanisms. This responsiveness allows tighter virtual machine memory footprints while preserving target application throughput, which is ideal for both embedded and utility computing domains. In short, we argue that formal, systematic approaches to memory management should be replacing ad-hoc heuristics as the discipline matures. Controltheoretic heap sizing is one such systematic approach.

show abstract

Sizing multi-space in heap for application isolation

Cited by 4 publications

References 2 publications

Control theory for principled heap sizing

Control theory for principled heap sizing

Security issues in cloud environments: a survey

Control theory for principled heap sizing

Contact Info

Product

Resources

About