Lab Home | Phone | Search
Center for Nonlinear Studies  Center for Nonlinear Studies
 Colloquia Archive 
 Postdoc Seminars Archive 
 Quantum Lunch 
 Quantum Lunch Archive 
 CMS Colloquia 
 Q-Mat Seminars 
 Q-Mat Seminars Archive 
 P/T Colloquia 
 Kac Lectures 
 Kac Fellows 
 Dist. Quant. Lecture 
 Ulam Scholar 
 CNLS Fellowship Application 
 Student Program 
 Past Visitors 
 History of CNLS 
 Maps, Directions 
 CNLS Office 
Monday, December 17, 2012
10:00 AM - 11:00 AM
CNLS Conference Room (TA-3, Bldg 1690)


Hash-based Algorithms for Massively Parallel Architectures

Bob Robey and Jonathan Robey
Eulerian Applications Group, XCP-2 and

We have developed a set of hash-based algorithms with a base operational complexity of O(n) which can replace the typically tree-based O(n log n) algorithms. These hash-based algorithms are also suitable for the finer grain parallelism of the next generation of parallel computing. To take full advantage of this new algorithm, a whole class of mesh-based operations (or in more general terms, discretized data) including sorting, neighbor calculations, remapping and table look-ups are demonstrated. Speed-ups on the CPU over current algorithms can be as high as 50x. These algorithms are also much easier to implement on the GPU and other future architectures than current tree-based algorithms with additional speed-ups of 10x-50x.

Host: Mikhail Shashkov, XCP-4 Methods and Algorithms, 667-4400