{"title":"四叉树问题的最优并行算法","authors":"Kasif S.","doi":"10.1006/ciun.1994.1019","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in <em>O</em>(log <em>N</em>) time using <em>N</em>/log <em>N</em> processors on a shared memory model of computation that allows concurrent reads or writes. Consequently they allow us to achieve optimal speedups using any number of processors up to <em>N</em>/log <em>N</em>. The approach can also be used to derive optimal processor-time parallel algorithms for weaker models of parallel computation.</p></div>","PeriodicalId":100350,"journal":{"name":"CVGIP: Image Understanding","volume":"59 3","pages":"Pages 281-285"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/ciun.1994.1019","citationCount":"8","resultStr":"{\"title\":\"Optimal Parallel Algorithms for Quadtree Problems\",\"authors\":\"Kasif S.\",\"doi\":\"10.1006/ciun.1994.1019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in <em>O</em>(log <em>N</em>) time using <em>N</em>/log <em>N</em> processors on a shared memory model of computation that allows concurrent reads or writes. Consequently they allow us to achieve optimal speedups using any number of processors up to <em>N</em>/log <em>N</em>. The approach can also be used to derive optimal processor-time parallel algorithms for weaker models of parallel computation.</p></div>\",\"PeriodicalId\":100350,\"journal\":{\"name\":\"CVGIP: Image Understanding\",\"volume\":\"59 3\",\"pages\":\"Pages 281-285\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1006/ciun.1994.1019\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CVGIP: Image Understanding\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1049966084710199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CVGIP: Image Understanding","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1049966084710199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in O(log N) time using N/log N processors on a shared memory model of computation that allows concurrent reads or writes. Consequently they allow us to achieve optimal speedups using any number of processors up to N/log N. The approach can also be used to derive optimal processor-time parallel algorithms for weaker models of parallel computation.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
