A Parallel Plane Sweep Algorithm Using OpenMP

摘要：

The parallelization of geo-computation is one of the kernels in High Performance Geographic Computing (HPGC). To gain the benefit provided by multi-core computer, lots of effort has been done on parallelizing classical serial algorithms, one of which is the plane sweep algorithm (PSA). A framework of parallelization when intersecting two sets of segments has been suggested. However, when focusing on the Minimum Bounding Rectangles (MBRs) in the filtration process in GIS, different optimization needs to be considered. In this paper, a parallel version of MBR based PSA is designed and implemented using OpenMP. The experiment results show that by carefully choosing the number of s threads and semisets, the proposed algorithm can significantly outperform the serial version on real-life data sets with a high speed-up.

关键词： Parallelization Plane Sweep Algorithm OpenMP

作者: CAI Lei WU Ye XIONG Wei JING Ning

作者单位: School of Electronics Science and Engineering National University of Defense Technology Changsha, China

会议类型: 国际会议

会议名称: 2011 International Conference on Database and Data Mining(ICDDM 2011)(2011年数据库和数据挖掘国际会议)

会议地点: 三亚

会议语种:英文

页码: 171-175

在线出版日期: 2011-03-25（万方平台首次上网日期，不代表论文的发表时间）