四叉树问题的最优并行算法

S. Kasif
{"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}
引用次数: 8

摘要

摘要本文描述了四叉树上的集运算(如并、交、比较)的最优处理器时间并行算法。本文提出的算法在允许并发读写的共享内存计算模型上使用N /log N个处理器,运行时间为O (log N)。因此,它们允许我们使用任意数量的处理器达到N /log N的最佳加速。该方法还可用于推导较弱的并行计算模型的最优处理器时间并行算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal parallel algorithms for quadtree problems
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Phase-Based Binocular Vergence Control and Depth Reconstruction Using Active Vision 3D Structure Reconstruction from Point Correspondences between two Perspective Projections Default Shape Theory: With Application to the Computation of the Direction of the Light Source Computational Cross Ratio for Computer Vision Refining 3D reconstruction: a theoretical and experimental study of the effect of cross-correlations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1