{'fraction_non_alphanumeric': 0.01676829268292683, 'fraction_numerical': 0.0, 'mean_word_length': 5.4411764705882355, '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}}
Toward a Taxonomy of Time-Constrained Applications

We are developing a taxonomy for classifying applications based on their time constraints. The taxonomy is based on three components that capture the key characteristics between different classes of applications: the process’s execution behavior, the timing constraints it requests, and the level of guarantee it is willing to accept from the system. The taxonomy is useful for two reasons: it provides a survey of the types of existing real-time scheduling applications, and it is a tool for understanding how to develop integrated schedulers that handle multiple classes of applications simultaneously.