{"title":"第k个最佳生成树的分布式生成算法","authors":"A. Khanna","doi":"10.1145/98949.99137","DOIUrl":null,"url":null,"abstract":"The problem at hand is to try and construct k spanning trees for a weighted connected graph, such that the weight of each constructed tree is less than a given w. This problem is called the kth best spanning tree problem. The sequential algorithm used is based on the procedure described by Maycda and Scshu. A distribution strategy for the parallel algorithm has been given. Spccdups for graph sizes varying from 5 vertices to 13 vertices have been shown and ana lyzed. Spccdups show that the distributed algorithm is cer tainly faster than the sequential algorithm, but also identify a bottleneck. All programs were implemented on the IN TEL iPSC/2.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"131 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A distributed algorithm for generation of the Kth best spanning tree\",\"authors\":\"A. Khanna\",\"doi\":\"10.1145/98949.99137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem at hand is to try and construct k spanning trees for a weighted connected graph, such that the weight of each constructed tree is less than a given w. This problem is called the kth best spanning tree problem. The sequential algorithm used is based on the procedure described by Maycda and Scshu. A distribution strategy for the parallel algorithm has been given. Spccdups for graph sizes varying from 5 vertices to 13 vertices have been shown and ana lyzed. Spccdups show that the distributed algorithm is cer tainly faster than the sequential algorithm, but also identify a bottleneck. All programs were implemented on the IN TEL iPSC/2.\",\"PeriodicalId\":409883,\"journal\":{\"name\":\"ACM-SE 28\",\"volume\":\"131 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 28\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/98949.99137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 28","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98949.99137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
这里的问题是尝试为一个加权连通图构造k棵生成树，使得每棵树的权值小于给定的w。这个问题被称为第k个最佳生成树问题。所使用的顺序算法是基于Maycda和Scshu描述的过程。给出了一种并行算法的分配策略。图的大小从5个顶点到13个顶点已经显示和分析。实例表明，分布式算法比顺序算法速度快，但也存在瓶颈。所有程序都在IN - TEL iPSC/2上实现。
A distributed algorithm for generation of the Kth best spanning tree
The problem at hand is to try and construct k spanning trees for a weighted connected graph, such that the weight of each constructed tree is less than a given w. This problem is called the kth best spanning tree problem. The sequential algorithm used is based on the procedure described by Maycda and Scshu. A distribution strategy for the parallel algorithm has been given. Spccdups for graph sizes varying from 5 vertices to 13 vertices have been shown and ana lyzed. Spccdups show that the distributed algorithm is cer tainly faster than the sequential algorithm, but also identify a bottleneck. All programs were implemented on the IN TEL iPSC/2.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
