{'fraction_non_alphanumeric': 0.026744186046511628, 'fraction_numerical': 0.0, 'mean_word_length': 5.674418604651163, '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}}
An Introduction to Real-Time Operating Systems: Scheduling Theory

The functionality that real-time applications require of their operating system is much different from the functionality required by non-time-constrained time-sharing applications. Most of the differences are in the methods used for job scheduling and the systems support necessary to implement the scheduling policies. In this paper, we consider the various types of application-level real-time requirements, and we explore several different approaches to scheduling that have been used or proposed to schedule real-time activities: the cyclic executive, deterministic scheduling, capacity-based scheduling, and others. Our emphasis will be on practical methods, and we will find that these approaches have different implications for design and development, system operation, and maintenance.