首页> 外文会议>IEEE East-West Design Test Symposium >Partitioning of ECE schemes components based on modified graph coloring algorithm
【24h】

Partitioning of ECE schemes components based on modified graph coloring algorithm

机译:基于改进图着色算法的ECE方案组件划分

获取原文

摘要

One of the most important design problems - electronic computing equipment (ECE) schemes components partitioning problem is considered in the article. It belongs to the class of NP-hard problems. Statement of a partitioning problem and an optimization criterion are defined. A new approach for solving partitioning problem based on the modified graph coloring algorithm is suggested. The modified partitioning algorithm which provides obtained solutions of a specified accuracy in polynomial time is developed. A modified graph coloring heuristic is described. Authors suggested a procedure for the transition from colored subsets to specify parts of the partition. The program environment and computing experiment are implemented. The series of tests and experiments have allowed specifying theoretical estimations of partitioning algorithms running time. The running time of the algorithm is represented as O (n).
机译:本文考虑了最重要的设计问题之一-电子计算设备(ECE)方案的组件划分问题。它属于NP-hard问题类别。定义了分区问题的陈述和优化标准。提出了一种基于改进的图着色算法解决分区问题的新方法。开发了改进的划分算法,该算法提供了多项式时间内指定精度的解决方案。描述了一种改进的图形着色试探法。作者提出了从彩色子集过渡到指定分区部分的过程。实现了程序环境和计算实验。通过一系列测试和实验,可以指定划分算法运行时间的理论估计。该算法的运行时间表示为O(n)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号