{'fraction_non_alphanumeric': 0.015090543259557344, 'fraction_numerical': 0.0, 'mean_word_length': 5.337579617834395, '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 features of global states based application control

Global predicates can be used for parallel/distributed application control. We consider a system, where processes report their local states to a monitor process. The monitor constructs strongly consistent global states (SCGS) and evaluates global predicates defined by a programmer on them. Predicate evaluation may trigger sending control signals to chosen processes. Signal reception activates an associated code section at the target process. We study such a control scheme paying attention to the delay between an occurrence of an application state and the reaction triggered by it, and to the possible frequency of decision making. We examine four versions of an SCGS algorithm, providing formulas characterizing expected delay they induce, taking into account system and application parameters. We analyze the rate of SCGS detection and we show how system and application parameters can be tuned to obtain the highest rate.