About this document
Vectorized Hashing for Sorting Algorithms by Storiesofsuperheroes is a document available to read on EtoBox.
This paper presents a vectorization technique for hashing and its application to sorting algorithms. The technique enables vector processors to execute multiple data entry into a hash table in parallel by detecting and handling collisions. This allows vectorizing address calculation sorting and distribution counting sort, which were previously unvectorizable. Evaluation shows the vectorized hashing improves performance by a factor of 12.7, and vectorized sorting improves performance by a factor of 12.8, com
- Author
- Storiesofsuperheroes
- Language
- EN