Add to ORKGAbstract. Typical theorem-proving workloads on the Poly/ML runtime may execute for several hours, occupying multi-gigabyte heaps. The run-time heap size may be fixed at execution startup time, or it may be al-lowed to vary dynamically. To date, runtime heap size growth has been implemented using simple hard-coded heuristics. In this position paper, we argue that a mathematically rigorous approach to heap sizing, based on control theory, is more appropriate
Size analysis can be an important part of heap consumption analysis. This paper is a part of ongoing...
Abstract. We study, formally and experimentally, the trade-off in tempo-ral and spatial overhead whe...
This paper presents a scheme to manage heap data in the local memory present in each core of a limit...
We propose a new, principled approach to adaptive heap sizing based on control theory. We review cur...
We propose a new, principled approach to adaptive heap sizing based on control theory. We review cur...
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely...
Our objective is to propose methods for resource-aware compila-tion inspired by the implicit complex...
Our objective is to propose methods for resource-aware compilation inspired by the implicit complexi...
Live heap space analyses have so far been concerned with the standard sequential programming model. ...
Multiple virtual machine (VM) workloads are increasingly common, given the growth of managed enterpr...
Multiple virtual machine (VM) workloads are increasingly com-mon, given the growth of managed enterp...
Most application’s performance is impacted by the amount of available memory. In a traditional appli...
International audienceThis work presents a technique to compute symbolic polynomial approximations o...
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct ...
We introduce the Forseti system, which is a principled ap-proach for holistic memory management. It ...
Size analysis can be an important part of heap consumption analysis. This paper is a part of ongoing...
Abstract. We study, formally and experimentally, the trade-off in tempo-ral and spatial overhead whe...
This paper presents a scheme to manage heap data in the local memory present in each core of a limit...
We propose a new, principled approach to adaptive heap sizing based on control theory. We review cur...
We propose a new, principled approach to adaptive heap sizing based on control theory. We review cur...
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely...
Our objective is to propose methods for resource-aware compila-tion inspired by the implicit complex...
Our objective is to propose methods for resource-aware compilation inspired by the implicit complexi...
Live heap space analyses have so far been concerned with the standard sequential programming model. ...
Multiple virtual machine (VM) workloads are increasingly common, given the growth of managed enterpr...
Multiple virtual machine (VM) workloads are increasingly com-mon, given the growth of managed enterp...
Most application’s performance is impacted by the amount of available memory. In a traditional appli...
International audienceThis work presents a technique to compute symbolic polynomial approximations o...
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct ...
We introduce the Forseti system, which is a principled ap-proach for holistic memory management. It ...
Size analysis can be an important part of heap consumption analysis. This paper is a part of ongoing...
Abstract. We study, formally and experimentally, the trade-off in tempo-ral and spatial overhead whe...
This paper presents a scheme to manage heap data in the local memory present in each core of a limit...