首页> 外文期刊>Programming and Computer Software >Optimization of a Data Dependence Graph for the Local Microcode Compaction Problem. Part 2: Algorithms and Experimental Verification
【24h】

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

机译:针对本地微码压缩问题的数据依赖图的优化。第2部分:算法和实验验证

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:讨论了用于解决共享静态资源上微码线性段的交换置换问题的方法的计算方案的结构。针对形成的结构的每个元素,开发了一种算法,并研究了其正确性和计算复杂性。考虑将解决上述问题的结果应用于水平微码的局部压缩。大量源数据的数值实验证实了解决局部压实问题的新方法的高计算效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号