Sökning: "CUDA"

Visar resultat 1 - 5 av 127 uppsatser innehållade ordet CUDA.

  1. 1. ML implementation for analyzing and estimating product prices

    Kandidat-uppsats, Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)

    Författare :Abel Getachew Kenea; Gabriel Fagerslett; [2024]
    Nyckelord :Machine Learning; ML; Regression; Deep Learning; Artificial Neural Network; ANN; TensorFlow; ScikitLearn; CUDA; cuDNN; Estimation; Prediction; AI; Artificial Intelligence; Price Tracking; Price Logging; Price Estimation; Supervised Learning; Random Forest; Decision Trees; Batch Learning; Hyperparameter Tuning; Linear Regression; Multiple Linear Regression; Maskininlärning; Djup lärning; Artificiellt Neuralt Nätverk; Regression; TensorFlow; SciktLearn; ML; ANN; Estimation; Uppskattning; CUDA; cuDNN; AI; Artificiell Intelligens; pris loggning; pris estimation; prisspårning; Batchinlärning; Hyperparameterjustering; Linjär Regression; Multipel Linjär Regression; Supervised Learning; Random Forest; Decision Trees;

    Sammanfattning : Efficient price management is crucial for companies with many different products to keep track of, leading to the common practice of price logging. Today, these prices are often adjusted manually, but setting prices manually can be labor-intensive and prone to human error. LÄS MER

  3. 2. A Conjugate Residual Solver with Kernel Fusion for massive MIMO Detection

    Master-uppsats, Högskolan i Halmstad/Centrum för forskning om tillämpade intelligenta system (CAISR)

    Författare :Ioannis Broumas; [2023]
    Nyckelord :MIMO; massive MIMO; GPU; CUDA; Software Defined Radio; SDR; MMSE; ZF; zero-forcing; parallel detection; iterative methods; conjugate residual; parallel computing; kernel fusion;

    Sammanfattning : This thesis presents a comparison of a GPU implementation of the Conjugate Residual method as a sequence of generic library kernels against implementations ofthe method with custom kernels to expose the performance gains of a keyoptimization strategy, kernel fusion, for memory-bound operations which is to makeefficient reuse of the processed data. For massive MIMO the iterative solver is to be employed at the linear detection stageto overcome the computational bottleneck of the matrix inversion required in theequalization process, which is 𝒪(𝑛3) for direct solvers. LÄS MER

  4. 3. Evaluating the performance of CUDA Graphs in common GPGPU programming patterns

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Mert Demirsü; Axel Lervik; [2023]
    Nyckelord :;

    Sammanfattning : CUDA Graphs is a relatively new and unexplored feature of CUDA that presents an alternative for submitting work to the GPU. This report aims to evaluate the performance benefits of CUDA Graphs. The means to this end was a benchmark suite containing CUDA applications that do not utilise CUDA Graphs. LÄS MER

  5. 4. Parallellisering i CUDA av LDPC-avkodningsalgoritmen MSA, för NVIDIA:s GPU:er

    M1-uppsats, Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)

    Författare :David Lindbom; Jonathan Pettersson; [2023]
    Nyckelord :LDPC; CUDA; MSA;

    Sammanfattning : Inom dagens samhälle är de flesta mobilenheter uppkopplade till en basstation. Mycket information förväntas kunna överföras från telefonen till basstationen utan några störningar för användaren. LÄS MER

  7. 5. Performance Benefits of Extending JavaScript Through WASM and CUDA : A Comparative Performance Investigation

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Hampus Hallkvist; Edvin Nordqvist; [2023]
    Nyckelord :;

    Sammanfattning : JavaScript is today the largest language based on usage with regard to web development. There is, therefore, a great incentive to make the language perform at its best and allow applications to take advantage of this. LÄS MER