{"title":"Semigroup computation and its applications on mesh-connected computers with hyperbus broadcasting","authors":"S. Horng","doi":"10.1109/ICPADS.1994.589892","DOIUrl":null,"url":null,"abstract":"Let /spl oplus/ be an associative operation on a domain D. The semigroup problem is to compute a/sub 0//spl oplus/a/sub 1//spl oplus/...a/sub N-1/, where a/sub i/ /spl isin/D, for 0/spl les/i<N. The algorithm described here runs on SIMD mesh-connected computers with hyperbus broadcasting using p processors in time O(N/p+logp), where p/spl les/N. It as shown optimal when p=N and optimal speedup when p log p=N. Based on the proposed semigroup algorithm, other applications such as matrix multiplication, all-pair shortest path, shortest path spanning tree, topological sorting and connected component problems can be also solved in the order of logarithmic time using N/sup 3/ processors.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1994.589892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Let /spl oplus/ be an associative operation on a domain D. The semigroup problem is to compute a/sub 0//spl oplus/a/sub 1//spl oplus/...a/sub N-1/, where a/sub i/ /spl isin/D, for 0/spl les/i