Sorting and Permuting without Bank Conflicts on GPUs

DOI10.1007/978-3-662-48350-3_2zbMath1465.68309arXiv1507.01391OpenAlexW2109605977MaRDI QIDQ3452764

Peyman Afshani, Nodari Sitchinava

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.01391

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Sorting and Permuting without Bank Conflicts on GPUs

Uses Software

• CUDA

Cites Work

• Cache-Oblivious Algorithms
• Sorting and Permuting without Bank Conflicts on GPUs
• Uniform Hashing in Constant Time and Optimal Space
• Some Computer Organizations and Their Effectiveness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sorting and Permuting without Bank Conflicts on GPUs