Optimization of a Data Dependence Graph for the Local Microcode Compaction Problem. Part 2: Algorithms and Experimental Verification

摘要

Structuring of the computational scheme of the method for solving the exchange permutability problem for a linear segment of a microcode on shared static resources is discussed. For each element of the structure formed, an algorithm is developed, and its correctness and computational complexity are studied. Applications of the results of solving the above problem to the local compaction of a horizontal microcode are considered. Numerical experiments with large amounts of source data substantiate high computational efficiency of the new approach to solving the local compaction problem.