{"title":"四叉树问题的最优并行算法","authors":"S. Kasif","doi":"10.1006/CIUN.1994.1019","DOIUrl":null,"url":null,"abstract":"Abstract 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.","PeriodicalId":100350,"journal":{"name":"CVGIP: Image Understanding","volume":"12 1","pages":"281-285"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Optimal parallel algorithms for quadtree problems\",\"authors\":\"S. Kasif\",\"doi\":\"10.1006/CIUN.1994.1019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract 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.\",\"PeriodicalId\":100350,\"journal\":{\"name\":\"CVGIP: Image Understanding\",\"volume\":\"12 1\",\"pages\":\"281-285\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CVGIP: Image Understanding\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1006/CIUN.1994.1019\",\"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://doi.org/10.1006/CIUN.1994.1019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract 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号
