{'fraction_non_alphanumeric': 0.018032786885245903, 'fraction_numerical': 0.0, 'mean_word_length': 5.641304347826087, '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}}
Operand processing and P-single operators

The data flow model of execution offers attractive properties for parallel processing. First, it is asynchronous: Because the readiness of data dictates the instruction execution. Second, it is self-scheduling: The data flow graph representation of a program eliminates the need to explicitly manage parallel execution. The architecture described in this article belongs to a class of dynamic dataflow architectures, in which the operand process control significantly affects the performance parameters as well as the system characteristics of the given architecture.