Sorting on CUDA
Location
Slavin Center
Start Date
13-4-2011 12:00 AM
End Date
13-4-2011 12:00 AM
Description
The traditional sorting technique, sequential sorting, is inefficient with increasing amounts of data that can be stored on computers. Researchers looking for faster sorting techniques have turned to parallel computing to address the limitations of sequential sorting. This project involves the implementation of three parallel sorting algorithms on CUDA, a parallel computing architecture which implements algorithms on Graphics Processing Units (GPUs).
Sorting on CUDA
Slavin Center
The traditional sorting technique, sequential sorting, is inefficient with increasing amounts of data that can be stored on computers. Researchers looking for faster sorting techniques have turned to parallel computing to address the limitations of sequential sorting. This project involves the implementation of three parallel sorting algorithms on CUDA, a parallel computing architecture which implements algorithms on Graphics Processing Units (GPUs).
