.png){kind=icon}
返回
Parallel intersection counting on shared-memory multiprocessors and GPUs
.png){kind=icon}
OA
AI
DOI：10.1016/j.future.2024.05.039.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Computing intersections among sets of one-dimensional intervals is an ubiquitous problem in computational geometry with important applications in bioinformatics, where the size of typical inputs is large and it is therefore important to use efficient algorithms. In this paper we propose a parallel algorithm for the 1D intersection -counting problem, that is, the problem of counting the number of intersections between each interval in a given set A and every interval in a set B . Our algorithm is suitable for shared -memory architectures (e.g., multicore CPUs) and GPUs. The algorithm is work -efficient because it performs the same amount of work as the best serial algorithm for this kind of problem. Our algorithm has been implemented in C++ using the Thrust parallel algorithms library, enabling the generation of optimized programs for multicore CPUs and GPUs from the same source code. The performance of our algorithm is evaluated on synthetic and real datasets, showing good scalability on different generations of hardware.
Keyword:
Intersection counting
Parallel algorithms
GPU programming
Shared-memory algorithm
Bioinformatics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
Regulation of the length of the fertile period in the domestic fowl by numbers of oviducal spermatozoa, as reflected by those trapped in laid eggs.png)
ReproductionOAAI
ReproductionIF0
OAAI分享收藏Wide Diversity in Measurements of Growth Hormone after Stimulation Tests in Short Children are Due to Assay Variability矮小儿童刺激试验后生长激素的测量差异很大OAAI
OAAI分享收藏
查看更多内容