摘要 : Compaction of memory in long running systems has always been important. The latency of compaction increases in today's systems with high memory demands and large heaps. To deal with this problem, we present a lock-free protocol al... 展开 Compaction of memory in long running systems has always been important. The latency of compaction increases in today's systems with high memory demands and large heaps. To deal with this problem, we present a lock-free protocol allowing for copying concurrent with the application running, which reduces the latencies of compaction radically. It provides theoretical progress guarantees for copying and application threads without making it practically infeasible, with performance overheads of 15% on average. The algorithm paves the way for a future lock-free Garbage Collector. 收起