完全加权二部图分配问题的一种完美加速并行算法

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI:10.1109/PARBSE.1990.77154

Constantine N. K. Osiakwan, S. Akl

{"title":"完全加权二部图分配问题的一种完美加速并行算法","authors":"Constantine N. K. Osiakwan, S. Akl","doi":"10.1109/PARBSE.1990.77154","DOIUrl":null,"url":null,"abstract":"The authors present an adaptive parallel algorithm for the assignment problem on complete weighted bipartite graphs, where the edge weights can be real valued and negative. The algorithm is designed using the exclusive-read, exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n vertices, the algorithm runs in O(n/sup 3//p+n/sup 2/p) time using p processors. The authors obtain a perfect speedup, with respect to the O(n/sup 3/) Hungarian method, for p<or= square root eta , where eta is the cardinality of the larger partite set.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs\",\"authors\":\"Constantine N. K. Osiakwan, S. Akl\",\"doi\":\"10.1109/PARBSE.1990.77154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present an adaptive parallel algorithm for the assignment problem on complete weighted bipartite graphs, where the edge weights can be real valued and negative. The algorithm is designed using the exclusive-read, exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n vertices, the algorithm runs in O(n/sup 3//p+n/sup 2/p) time using p processors. The authors obtain a perfect speedup, with respect to the O(n/sup 3/) Hungarian method, for p<or= square root eta , where eta is the cardinality of the larger partite set.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77154\",\"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. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

针对完全加权二部图的边权可以为实数和负值的情况，提出了一种自适应并行算法。该算法采用并行计算的唯读、唯写并行随机存取机(EREW PRAM)模型进行设计。对于n个顶点的完全加权二部图，算法使用p个处理器，运行时间为O(n/sup 3//p+n/sup 2/p)。对于p>，作者获得了相对于O(n/sup 3/)匈牙利方法的完美加速。

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

查看原文本刊更多论文

A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs

The authors present an adaptive parallel algorithm for the assignment problem on complete weighted bipartite graphs, where the edge weights can be real valued and negative. The algorithm is designed using the exclusive-read, exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n vertices, the algorithm runs in O(n/sup 3//p+n/sup 2/p) time using p processors. The authors obtain a perfect speedup, with respect to the O(n/sup 3/) Hungarian method, for p>

求助全文

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

来源期刊

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

自引率

0.00%

发文量