{"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}
引用次数: 8
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1993] Proceedings Seventh International Parallel Processing Symposium](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
