{'fraction_non_alphanumeric': 0.015084294587400177, 'fraction_numerical': 0.0, 'mean_word_length': 5.032085561497326, '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 approach to message arbitration in hard real-time applications

The present paper concerns the problem dealing with shared resource utilization in the hard real-time environment. Message transmissions via a serial bus or message processing by a router are examples of shared resource requests in networks. Hard real-time request must be completed within a certain deadline. When multiple requests are appeared they spend a part of time waiting for the resource access. The time lost depends on the shared resource arbitration scheme. One of such schemes called the ldquolast lowest schemerdquo is discussed in the paper. The last lowest priority scheme represents a variant of the scheme. The round-robin scheme doesnpsilat provide different deadlines for different shared resource requestors, which is very important for the hard real-time applications. The method to avoid this disadvantage is suggested and evaluated in the paper. The arbitration scheme suggested can be implemented both in software and hardware. The article presents an implementation of the method in a distributed arbiter for a single wire serial bus.