Discrete range searching primitive for the GPU and its applications

DOI10.1145/2133803.2345679zbMath1284.68640OpenAlexW1991052044MaRDI QIDQ5406285

Kishore Kothapalli, P. J. Narayanan, Jyothish Soman

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2133803.2345679

zbMATH Keywords

range searchingGPGPUsuccinct representationtree queries

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU

Uses Software

• CUDA
• OpenCL
• GPU Quicksort

This page was built for publication: Discrete range searching primitive for the GPU and its applications