9043

Efficiency of Parallelization of Neural Network Algorithm on Graphic Cards

Dariusz Konieczny, Karol Radziszewski
Institute of Informatics, Technical University of Wroclaw, Wybrzeze Wyspianskiego 27, 50-370 Wroclaw
Information Systems Architecture and Technology, 2012
@article{konieczny2012efficiency,

   title={Efficiency of Parallelization of Neural Network Algorithm on Graphic Cards},

   author={Konieczny, Dariusz and Radziszewski, Karol},

   journal={Information Systems Architecture and Technology},

   year={2012}

}

Download Download (PDF)   View View   Source Source   

723

views

In this paper we are testing the efficiency of parallelization with use of graphic cards. There are many applications where such systems occurs in common, so we choose the domain of artificial neural networks. Actually sold graphic cards gives us strong potential in speeding up calculations and card vendors provide us with even more, giving access to software and documentation, like in CUDA (Compute Unified Device Architecture). But instead of using prepared libraries for algebra, in this work we use the run-time layer of CUDA technology, which gives us more flexibility and almost full control over the hardware. Also, we will show more technical details of implemented algorithms and methods than in other papers regarding this topic. Because of differences in architectures of systems running sequential and parallel versions of applications there was necessity to redefine the original definition of efficiency to compare the heterogeneous systems. We tested our solutions on selected graphics cards with CUDA capability. Input data for neural network which served as benchmark data were global features extracted from histopathological HER-2 images.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Follow us on Twitter

HGPU group

1943 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

442 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: