CONCURRENCY AND SCALABILITY VERSUS FRAGMENTATION AND COMPACTION WITH COMPACT-FIT

Abstract. We study, formally and experimentally, the trade-off in tempo-ral and spatial overhead when managing contiguous blocks of memory using the explicit, dynamic and real-time heap management system Compact-fit (CF). The key property of CF is that temporal and spatial overhead can be bounded, related, and predicted in constant time through the notion of partial and incremental compaction. Partial compaction determines the maximally tolerated degree of memory fragmentation. Incremental compaction of ob-jects, introduced here, determines the maximal amount of memory involved in any, logically atomic, portion of a compaction operation. We explore CF’s po-tential application space on (1) multiprocessor and multicore systems as well as on (2) memory-constrained uniprocessor systems. For (1), we argue that little or no compaction is likely to avoid the worst case in temporal as well as spatial overhead but also observe that scalability only improves by a constant factor. Scalability can be further improved significantly by reducing overall data sharing through separate instances of Compact-fit. For (2), we observe that incremental compaction can effectively trade-off throughput and memory fragmentation for lower latency. 1