Title :
Parallel hashed key access on the Connection Machine
Author :
Anderson, Paul B.
Author_Institution :
Planning Res. Corp., McLean, VA, USA
Abstract :
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
Keywords :
file organisation; parallel processing; Connection Machine; X-ray crystallography application; algorithm; data parallel adaptation; hash table; multiple-data stream; parallel hashed key access; single-instruction stream; Crystallography; Parallel algorithms; Probes; Springs;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-5892-4
DOI :
10.1109/FMPC.1988.47509
