A GPU-Friendly Skiplist Algorithm

נורית מושקוביץ, הרצאה סמינריונית למגיסטר
יום רביעי, 19.4.2017, 14:00
טאוב 601
Prof. E. Petrank

We propose a design for a fine-grained lock-based skiplist optimized for Graphics Processing Units (GPUs). While GPUs are often used to accelerate streaming parallel computations, it remains a significant challenge to efficiently offload concurrent computations with more complicated data- irregular access and fine-grained synchronization. Natural building blocks for such computations would be concurrent data structures, such as skiplists, which are widely used in general purpose computations. Our design utilizes array-based nodes which are accessed and updated by warp-cooperative functions, thus taking advantage of the fact that GPUs are most efficient when memory accesses are coalesced and execution divergence is minimized. The proposed design has been implemented, and measurements demonstrate improved performance of up to 9.4x over skiplist designs for the GPU existing today.

בחזרה לאינדקס האירועים