SEARCH SESSIONS

Search All
 
Refine Results:
 
Year(s)

SOCIAL MEDIA

EMAIL SUBSCRIPTION

 
 

GTC ON-DEMAND

Developer - Algorithms
Presentation
Media
Ballot Counting for Optimal Binary Prefix Sum
Speakers:
David Whittaker
- University of Alabama at Birmingham
Abstract:
This poster describes a new technique for performing binary prefix sums using Fermi''s new __ballot() and __popc() functions. These instructions greatly increase intra-warp communication, allowing for an 80% speedup over standard GPU methods in applications like Radix Sort. It also points to future research that will enable suffix array construction, Burrows-Wheeler Transform, and the BZIP algorithm to take advantage of these instructions for efficient GPU compression.
 
Topics:
Developer - Algorithms
Type:
Poster
Event:
GTC Silicon Valley
Year:
2010
Session ID:
P10A09
Download:
Share: