{'fraction_non_alphanumeric': 0.03209242618741977, 'fraction_numerical': 0.0, 'mean_word_length': 5.046511627906977, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A comprehensive analytical model for garbage collection algorithms

We present an analytical model that allows to compare all known garbage collection (GC) algorithms w.r.t. various performance measures. The overhead functions are natural and accurate; natural in the sense that they are given in terms of easy to measure and tune parameters, accurate in the sense that they account for all relevant sources of time and space overhead of the different algorithms. Space overhead accounted for includes mark bits, mark stack, reference count bits/tables, entry tables for area-GC, object tables etc. as well as storage fragmentation. Time overhead components are e.g. time to mark/scan/copy nodes, update reference counts, check for forwarding pointers, synchronization costs etc.