GPU-Based Algorithms for Processing the k Nearest-Neighbor Query on Spatial Data Using Partitioning and Concurrent Kernel Execution

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Parallel Programming Pub Date : 2023-07-21 DOI:10.1007/s10766-023-00755-8

Polychronis Velentzas, M. Vassilakopoulos, A. Corral, C. Antonopoulos

引用次数: 0

Abstract Image

查看原文本刊更多论文

基于gpu的空间数据k近邻查询分区和并发内核执行算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

International Journal of Parallel Programming 工程技术-计算机：理论方法

CiteScore

4.40

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： International Journal of Parallel Programming is a forum for the publication of peer-reviewed, high-quality original papers in the computer and information sciences, focusing specifically on programming aspects of parallel computing systems. Such systems are characterized by the coexistence over time of multiple coordinated activities. The journal publishes both original research and survey papers. Fields of interest include: linguistic foundations, conceptual frameworks, high-level languages, evaluation methods, implementation techniques, programming support systems, pragmatic considerations, architectural characteristics, software engineering aspects, advances in parallel algorithms, performance studies, and application studies.