An Analysis of Hashing on Parallel and Vector Computers

Parallel hashing is well-known in the folklore of parallel computing, but there has been a remarkable dearth of literature describing it in detail. Because many parallel algorithms such as histogramming, set intersection and dictionary lookup can make use of hashing as a core step, hashing is a fundamental parallel operation. This paper sheds light on the performance that may be achieved using parallel hashing algorithms and should lend credibility to their use.