{'fraction_non_alphanumeric': 0.028089887640449437, 'fraction_numerical': 0.0, 'mean_word_length': 5.230769230769231, '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 Complexity Study of Garbage Collection for Small Devices

Garbage collection techniques have been the focus of numerous research works. In particular, their efficiencies and properties have been measured and discussed for years, concerning their use on computers. Today, virtual machines are increasingly considered for constraints devices such as smart cards, sensors, or personal digital assistants (pdas). These small devices have a specific hardware configuration. In particular, the memories used can be very different of the RAM (e.g. EEPROM, Flash memory, different types of RAM, etc.). Although garbage collection has been widely studied in the past decades, existing works do not take into account the specifics of such memories. This article presents a fine complexity study which takes into account the properties of the memories, especially their read and write access speeds.