首页> 外文会议>Systems, Man and Cybernetics, 1992 >Integer programming techniques for multiway system partitioningunder timing and capacity constraints
【24h】

Integer programming techniques for multiway system partitioningunder timing and capacity constraints

机译:在时序和容量约束下用于多路系统分区的整数编程技术

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

摘要

Efficient and effective algorithms for multichip module (MCM)nsystem partitioning under timing and capacity constraints are proposed.nAdvantage is taken of the small number of chip slots (compared to thenlarge number of circuit modules) and the problem formulation isntransformed into an integer programming problem. An approach callednConstraints Decoupling, which decomposes the original dual-constraintnproblem into two independent single-constraint problems, which are muchneasier to solve is proposed. Experimental results are encouraging andnall timing and capacity violations in the initial designs can beneliminated
机译:提出了一种在时序和容量约束下进行多芯片模块(MCM)系统分区的高效有效的算法。nAdvantage采用了少量的芯片插槽(相比于大量的电路模块),并将问题的表达形式转化为整数规划问题。提出了一种称为“约束解耦”的方法,该方法将原始的双重约束问题分解成两个独立的单约束问题,这些问题需要更轻松地解决。实验结果令人鼓舞,并且可以消除初始设计中的所有时序和容量违规情况

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号