A Vectorization Technique of Hashing and Its Application to Several Sorting Algorithms

This paper presents a vectorized algorithm for entering data into a hash table. A program that enters multiple data could not be executed on vector processors by conventional vectorization techniques because of data dependences. Our method enables execution of multiple data entry by conventional vector processors and improves the performance by a factor of 12.7 when entering 4099 pieces of data on the Hitachi S-810, compared to the normal sequential method. This method is applied to the address calculation sorting and the distribution counting sort, whose main part was unvectorizable by previous techniques. It improves performance by a factor of 12.8 when n = 214 on the S810.

• Type: Conference
• Year: 1990
• Where: PARBASE
• Authors: Yasusi Kanada
• Keywords: Conventional Vectorization Techniques, Multiple Data, PARBASE 1990, Vector Processors