Parallel hashed key access on the Connection Machine
Paul B. Anderson · 2003
The author discusses retrieval of a number of keys in parallel from a single hash table. The algorithm is a data parallel adaptation of a familiar sequential method. Changes made to suit the single-instruction stream, multiple-data stream Connection Machine are described. Running time is proportional to the maximum run of collisions rather than the average number. The algorithm was developed as a portion of a large X-ray crystallography application for the Connection Machine. The generality of the scheme makes it useful for other massively parallel applications.>