Abstract—Two of the most commonly used hashing strategies—linear probing and hashing with chaining—are adapted for efficient execution on a Cray XMT. These.

Two of the most commonly used hashing strategies-linear probing and hashing with chaining-are adapted for efficient execution on a Cray XMT.

Several strategies for hashing on a Cray XMT are experimentally compared. These strategies are designed to minimize memory contention. Results show good ...

Two of the most commonly used hashing strategies-linear probing and hashing with chaining-are adapted for efficient execution on a Cray XMT.

Two of the most commonly used hashing strategies-linear probing and hashing with chaining-are adapted for efficient execution on a Cray XMT.

Experimental results show good scalability up to 128 processors on two power law datasets with different data types: integer and string.

Fundamental computer science concept and data structure. – First described in 1953. • A fast and scalable implementation for the Cray XMT has been lacking.

Two of the most commonly used hashing strategies-linear probing and hashing with chaining-are adapted for efficient execution on a Cray XMT.

Several strategies for hashing on a Cray XMT are experimentally compared. These strategies are designed to minimize memory contention.

Apr 19, 2010 · Several strategies for hashing on a Cray XMT are experimentally compared. These strategies are designed to minimize memory contention.