{'fraction_non_alphanumeric': 0.020766773162939296, 'fraction_numerical': 0.0, 'mean_word_length': 5.11219512195122, '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}}
Utilizing Imprecise Results in Real-Time Systems

Abstract : In a hard real-time system, all real-time tasks must complete before their individual deadlines. Since the execution times of real-time tasks may vary and the load level on a system may fluctuate, it is difficult to guarantee that all deadlines are met at all times. In our model, a result produced by a computation is said to be precise if the computation runs to normal termination. If an intermediate result is made available by the computation at the deadline even when it has not totally completed, the result is said to be imprecise. This project is concerned with the design and evaluation of programming primitives, scheduling algorithms and system supports for the imprecise computation model. The model allows early results produced by partially completed computations to be effectively used to ensure the timeliness of real-time systems and to achieve graceful degradation. In the past year, we have looked into four issues related to real-time imprecise computations: timing constraint implementation, performance analysis, performance polymorphism, and scheduling parallelizable imprecise computations. In this report, we present the summary of research in each of these topics.