Hashing strategies for the Cray XMT.
Conference
·
OSTI ID:1001006
- PNNL
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.
- Research Organization:
- Sandia National Laboratories
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1001006
- Report Number(s):
- SAND2010-2369C
- Country of Publication:
- United States
- Language:
- English
Similar Records
Hashing Strategies for the Cray XMT
Contention Modeling for Multithreaded Distributed Shared Memory Machines: The Cray XMT
Input-independent, Scalable and Fast String Matching on the Cray XMT
Conference
·
Mon Apr 19 00:00:00 EDT 2010
·
OSTI ID:986263
Contention Modeling for Multithreaded Distributed Shared Memory Machines: The Cray XMT
Conference
·
Wed Jul 27 00:00:00 EDT 2011
·
OSTI ID:1023734
Input-independent, Scalable and Fast String Matching on the Cray XMT
Conference
·
Mon May 25 00:00:00 EDT 2009
·
OSTI ID:973738