首页> 外文会议>Massively parallel processing using optical interconnections >The Difficulty of Finding Good Embeddings of Program Graphs onto the OPAM Architecture
【24h】

The Difficulty of Finding Good Embeddings of Program Graphs onto the OPAM Architecture

机译:在OPAM架构上找到程序图的良好嵌入的困难

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

摘要

In this paper we describe a problem that arises in mapping process graphs onto a certain communication architecture. The problem is called Bounded p-Contractability. We have shown in earlier work that the problem is NP-complete. In this paper we present two results. The first is a result on a corresponding approximation problem. The second is a heuristic for the problem based on local search. The heuristic is compared with an existing heuristic for the problem.
机译:在本文中,我们描述了在将过程图映射到某个通信体系结构时出现的问题。该问题称为有界p可收缩性。我们在较早的工作中已经证明问题是NP完全的。在本文中,我们提出两个结果。首先是相应的近似问题的结果。第二种是基于本地搜索的启发式问题。将启发式方法与问题的现有启发式方法进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号