{'fraction_non_alphanumeric': 0.010923535253227408, 'fraction_numerical': 0.0, 'mean_word_length': 5.72, '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}}
Performance of distributed software implemented by a contention bus

The dominant features of software for distributed computer systems are communication between processes, potential parallel execution of processes, and non-determinism. This paper examines how a software architecture can be expected to use a distributed computer system based on a contention bus. Processes tend to be fine-grained and transmit short messages. An operating system kernel that implements process interactions introduces an additional source of short messages used to coordinate process interactions. Existing analyses of contention bus performance show that traffic patterns will be unable to utilize more than a fraction of the potential contention bus bandwidth. This paper suggests some possible ways to extend performance models to more accurately reflect the features of software for distributed computer systems. It also suggests an approach to improving channel efficiency for implementations of distributed software.