Module Merging: aggressive optimization and code replacement in highly available systems

In this paper, we propose a method to enable aggressive, interproceduraloptimization in a setting where code can be replaced at runtime. Codereplacement involves both introducing a new module into the system and deallocatingold code. Code purging deallocates replaced code, which is requiredin long running systems.Our approach, module merging, is simple and practical: we merge codemodules and insert code to check for code replacement at the appropriatepoints. We show how to preserve the...