http://132.161.132.157/drupal6/taxonomy/term/381/0 en http://132.161.132.157/drupal6/node/561 <p> On Thursday, April 19, Tolu Alabi 2013, Brad Gordon 2012, and Russel Steinbach 2012 will discuss their work in summer 2011 on parallel algorithms for computing order statistics: </p> <blockquote> <p> How do you select the 1,678,341st largest number out of a list of 500 million numbers? The answer is surprisingly simple, and will be the subject of our Thursday Extra. We will present two efficient, parallel algorithms for selecting the <var>k</var>th largest element out of very large lists, a problem known as <var>k</var>-selection. We will discuss how graphics processing units (GPUs) enable us to easily and efficiently implement these algorithms on single computers. </p> </blockquote> <p> Refreshments will be served at 4:15 p.m. in the Computer Science Commons (Noyce 3817). The talk, <q><var>K</var>-selection on the GPU,</q> will follow at 4:30 p.m. in Noyce 3821. Everyone is welcome to attend! </p> http://132.161.132.157/drupal6/node/561#comments algorithms GPUs order statistics parallelism selection Thursday Extras Wed, 18 Apr 2012 14:09:08 +0000 stone 561 at http://132.161.132.157/drupal6