Sökning: "Matrix Vector Multiplication"
Visar resultat 1 - 5 av 8 uppsatser innehållade orden Matrix Vector Multiplication.
1. Effects of Varying Precision on a FPGA using the SpMXV problem : A comparative study
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : With Moore’s Law slowing down, designing computer hardware that keeps up with the performance demands is becoming increasingly difficult. An interesting area of research is the Field Programmable Gate Array (FPGA) which is a re-programmable hardware device, and which might not be as dependent on Moore’s Law as other hardware. LÄS MER
2. Evaluation of Ferroelectric Tunnel Junction memristor for in-memory computation in real world use cases
Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknikSammanfattning : Machine learning algorithms are experiencing unprecedented attention, but their inherent computational complexity leads to high energy consumption. However, a paradigm shift in computing methods has the potential to address the issue. LÄS MER
3. REAL-TIME HYPERSPECTRAL IMAGE ANALYSIS ON GPU HARDWARE : Performance impact of different GPU architecture implementations
Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : This paper examines the optimization possibilities of using different GPU memory for a hyperspectral imaging algorithm. It focuses on the global memory, the shared memory, and the constant memory of the GPU. LÄS MER
4. Analysis of GPU accelerated OpenCL applications on the Intel HD 4600 GPU
Master-uppsats, Linköpings universitet/Programvara och systemSammanfattning : GPU acceleration is the concept of accelerating the execution speed of an application by running it on the GPU. Researchers and developers have always wanted to achieve greater speed for their applications and GPU acceleration is a very common way of doing so. LÄS MER
5. Sparse-Matrix support for the SkePU library for portable CPU/GPU programming
Master-uppsats, Linköpings universitet/Institutionen för datavetenskapSammanfattning : In this thesis work we have extended the SkePU framework by designing a new container data structure for the representation of generic two dimensional sparse matrices. Computation on matrices is an integral part of many scientific and engineering problems. Sometimes it is unnecessary to perform costly operations on zero entries of the matrix. LÄS MER