在互连缓存并行处理网络中嵌入通信模式的启发式方法

[1993] Proceedings Seventh International Parallel Processing Symposium Pub Date : 1993-04-13 DOI:10.1109/IPPS.1993.262895

Vipul Gupta, E. Schenfeld

{"title":"在互连缓存并行处理网络中嵌入通信模式的启发式方法","authors":"Vipul Gupta, E. Schenfeld","doi":"10.1109/IPPS.1993.262895","DOIUrl":null,"url":null,"abstract":"The problem of identifying whether a graph has a bounded l-contraction for a given integer l is known to be NP-complete for l>2. The authors describe a heuristic approach based on simulated annealing to approximate the solution of this problem. Performance results of their algorithm on graphs representing classical topologies (e.g. trees, grids, hypercubes and cube connected cycles), are presented as well.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A heuristic approach for embedding communication patterns in an interconnection cached parallel processing network\",\"authors\":\"Vipul Gupta, E. Schenfeld\",\"doi\":\"10.1109/IPPS.1993.262895\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of identifying whether a graph has a bounded l-contraction for a given integer l is known to be NP-complete for l>2. The authors describe a heuristic approach based on simulated annealing to approximate the solution of this problem. Performance results of their algorithm on graphs representing classical topologies (e.g. trees, grids, hypercubes and cube connected cycles), are presented as well.<<ETX>>\",\"PeriodicalId\":248927,\"journal\":{\"name\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1993.262895\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

对于给定的整数l，确定图是否具有有界l收缩的问题已知是对于l>2的np完全问题。作者描述了一种基于模拟退火的启发式方法来近似求解这一问题。他们的算法在表示经典拓扑(如树、网格、超立方体和立方体连接环)的图上的性能结果也被给出。b>

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A heuristic approach for embedding communication patterns in an interconnection cached parallel processing network

The problem of identifying whether a graph has a bounded l-contraction for a given integer l is known to be NP-complete for l>2. The authors describe a heuristic approach based on simulated annealing to approximate the solution of this problem. Performance results of their algorithm on graphs representing classical topologies (e.g. trees, grids, hypercubes and cube connected cycles), are presented as well.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1993] Proceedings Seventh International Parallel Processing Symposium

自引率

0.00%

发文量