Publication

Limitations of Partial Compaction: Towards Practical Bounds

Nachshon Cohen
2017
Journal Articles

Abstract

Compaction of a managed heap is a costly operation to be avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blowup. Previous study of compaction limitation provided some initial asymptotic bounds but no implications for practical systems. In this work, we extend the theory to obtain better bounds and make them strong enough to become meaningful for modern systems.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Limitations of Partial Compaction: Towards Practical Bounds

Chat with Graph Search

Excited State-Specific CASSCF Theory for the Torsion of Ethylene

Acceleration of graph pattern mining and applications to financial crime

Quantitative Methods for Omnichannel Decision-Making