{"title":"在最小路由负载的超立方体上嵌入金字塔","authors":"R. Sen","doi":"10.1109/DMCC.1990.556401","DOIUrl":null,"url":null,"abstract":"The problem of embedding a pyramid on a boolean hypercube has been addressed. A maximal set of edges of the pyramid having an image edge in the hypercube is found. This is based on a breadth-first search that embeds a maximal bipartite subgraph of the pyramid. It has been shown that for a pyramid 70% of its edges may always have image edges in the hypercube. These edges may be statically mapped. This would reduce run-time routing load in the hypercube computer considerably.","PeriodicalId":204431,"journal":{"name":"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Embedding A Pyramid On The Hypercube With Minimal Routing Load\",\"authors\":\"R. Sen\",\"doi\":\"10.1109/DMCC.1990.556401\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of embedding a pyramid on a boolean hypercube has been addressed. A maximal set of edges of the pyramid having an image edge in the hypercube is found. This is based on a breadth-first search that embeds a maximal bipartite subgraph of the pyramid. It has been shown that for a pyramid 70% of its edges may always have image edges in the hypercube. These edges may be statically mapped. This would reduce run-time routing load in the hypercube computer considerably.\",\"PeriodicalId\":204431,\"journal\":{\"name\":\"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1990.556401\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1990.556401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Embedding A Pyramid On The Hypercube With Minimal Routing Load
The problem of embedding a pyramid on a boolean hypercube has been addressed. A maximal set of edges of the pyramid having an image edge in the hypercube is found. This is based on a breadth-first search that embeds a maximal bipartite subgraph of the pyramid. It has been shown that for a pyramid 70% of its edges may always have image edges in the hypercube. These edges may be statically mapped. This would reduce run-time routing load in the hypercube computer considerably.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
