Two examples of GPGPU acceleration of memory-intensive algorithms

he advent of GPGPU technologies has allowed for sensible speed-ups in many high-dimension, memory-intensive computational problems. In this paper we demonstrate the effectiveness of such techniques by describing two applications of GPGPU computing to two different subfields of computer graphics, namely computer vision and mesh processing. In the first case, CUDA technology is employed to accelerate the computation of approximation of motion between two images, known also as optical flow. As for mesh processing, we exploit the massively parallel architecture of CUDA devices to accelerate the face clustering procedure that is employed in many recent mesh segmentation algorithms. In both cases, the results obtained so far are presented and thoroughly discussed, along with the expected future development of the work.

@InProceedings{MMGSS10,
  author       = {Marras, S. and Mura, C. and Gobbetti, E. and Scateni, R. and Scopigno, R.},
  title        = {Two examples of GPGPU acceleration of memory-intensive algorithms},
  booktitle    = {Eurographics Italian Chapter Conference},
  pages        = {49--56},
  month        = {november},
  year         = {2010},
  organization = {Eurographics},
  keywords     = {GPGPU},
  url          = {https://publications.crs4.it/pubdocs/2010/MMGSS10},
}