• DocumentCode
    3670729
  • Title

    Multi-GPU implementation of k-nearest neighbor algorithm

  • Author

    Jan Masek;Radim Burget;Jan Karasek;Vaclav Uher;Malay Kishore Dutta

  • Author_Institution
    Brno University of Technology, Faculty of Electrical engineering, Department of Telecommunications, Czech Republic
  • fYear
    2015
  • fDate
    7/1/2015 12:00:00 AM
  • Firstpage
    764
  • Lastpage
    767
  • Abstract
    Using modern Graphic Processing Units (GPUs) becomes very useful for computing complex and time consuming processes. GPUs provide high-performance computation capabilities with a good price. This paper deals with a multi-GPU OpenCL implementation of k-Nearest Neighbor (k-NN) algorithm. The proposed OpenCL algorithm achieves acceleration up to 750x in comparison with a single thread CPU version. The common k-NN was modified to be faster when the lower number of k neighbors is set. The performance of algorithm was verified with two GPUs dual-core NVIDIA GeForce GTX 690 and CPU Intel Core i7 3770 with 4.1 GHz frequency. The results of speed up were measured for one GPU, two GPUs, three and four GPUs. We performed several tests with data sets containing up to 4 million elements with various number of attributes.
  • Keywords
    "Graphics processing units","Testing","Machine learning algorithms","Java","Signal processing algorithms","Acceleration","Telecommunications"
  • Publisher
    ieee
  • Conference_Titel
    Telecommunications and Signal Processing (TSP), 2015 38th International Conference on
  • Type

    conf

  • DOI
    10.1109/TSP.2015.7296368
  • Filename
    7296368