{'fraction_non_alphanumeric': 0.025152439024390245, 'fraction_numerical': 0.0, 'mean_word_length': 5.222748815165877, '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}}
On the Feasibility of Response Time Predictions --- An Experimental Evaluation

In real-time systems guarantees about the response times of tasks are of crucial importance. It has to be strictly assured, that each critical task delivers its results in time, i.e. before its deadline. Experiments have been performed to investigate the feasibility of realistic response time predictions in practical systems, i.e. taking into account system overheads for clock synchronization, scheduling, and communication. Tasks with a simple sequential structure were executed on a state-of-the-art target system, and their execution times and response times, as well as the system overhead were measured. The observed values were then evaluated. Firstly the measured execution times of tasks and system routines were compared with computed execution times, thereby evaluating the quality of source code based execution time analysis. Secondly, we investigated the time consumption of operating system routines and DMA activities. The results of the experiments show that response time predictions are feasible. However, in current architectures the overhead for system activities is high, thus extending the bounds unreasonably. Changes in hardware and software architectures will be a necessity for future real-time systems.