{'fraction_non_alphanumeric': 0.02195945945945946, 'fraction_numerical': 0.0, 'mean_word_length': 5.475409836065574, '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}}
The interval page table: virtual memory support in real-time and memory-constrained embedded systems

We present a novel page table organization for real-time and memory-constrained embedded systems. Increasingly many high-end embedded processors offer virtual memory support in the form of hardware Memory Management Unit. To implement virtual memory support, however, the system software needs to maintain a page table per task, which captures the virtual to physical page translation information. Page tables have been traditionally designed for general-purpose systems where their size and real-time performance have not been of primary importance; the average performance of page table traversal has been the major concern. Many embedded systems, however, impose strict real-time requirements coupled with limited memory resources. To address this problem, we propose a new page table organization, which not only requires significantly less memory than the traditional page tables, but also enables a very fast and deterministic hardware-based page table lookup. This is achieved by exploiting application knowledge regarding the memory footprint of the program under execution.