Hashing strategies for the Cray XMT
Eric L. Goodman, David J. Haglin, Chad Scherrer, Daniel Chavarría-Miranda, Jace Mogill, John Feo · 2010
Two of the most commonly used hashing strategies-linear probing and hashing with chaining-are adapted for efficient execution on a Cray XMT. These strategies are designed to minimize memory contention. Datasets that follow a power law distribution cause significant performance challenges to shared memory parallel hashing implementations. Experimental results show good scalability up to 128 processors on two power law datasets with different data types: integer and string. These implementations can be used in a wide range of applications.