By Topic

Lock-free Hash Table on Graphics Processors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Moazeni, M. ; Comput. Sci. Dept., Univ. of California, Los Angeles, Los Angeles, CA, USA ; Sarrafzadeh, M.

Lock-free data structures guarantee higher throughput than lock-based implementations in parallel architectures. This paper presents the first CAS-based lock-free hash table that is based on chaining on GPUs. We achieve an improvement of about 2-8X over lock-free OpenMP implementation. We also achieve over 2-25X speed up over GPU lock-based implementation. We achieve 1.3X to 3.5X increase on throughput with combined Insert and Search workloads over the counterpart OpenMP implementation.

Published in:

Application Accelerators in High Performance Computing (SAAHPC), 2012 Symposium on

Date of Conference:

10-11 July 2012