{'fraction_non_alphanumeric': 0.010371650821089023, 'fraction_numerical': 0.0, 'mean_word_length': 5.397790055248619, '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}}
A Control Word Model for detecting conflicts between microprograms

The compilation and optimization of a microprogram for a computer with a horizontal control word format is highly machine dependent. The compilation phase involves the detection of parallelism in a sequence of source statements followed by a mapping into a sequence of microoperations. The optimization phase involves combining these microoperations to form microinstructions in an optimal manner. One of the important subprocesses of the optimization phase is determining whether or not two or more microoperations can be executed concurrently.
 This paper presents the Control Word Model for determining when two or more microoperations can be executed concurrently. The Control Word Model is a machine independent model of the semantics of the control words for microprogrammable computers. As will be demonstrated, the concurrency permitted is sometimes determined not simply by the hardware configuration of buses, register, memories, and ALUs but also by the format of the control word chosen by the designer. This observation has motivated the development of the Control Word Model.