Sökning: "SIMD"

Visar resultat 1 - 5 av 39 uppsatser innehållade ordet SIMD.

  1. 1. Performance Evaluation of Digital Image Processing on the Web using WebAssembly

    Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Avdelningen för beräkningsvetenskap

    Författare :Christoffer Nyberg; [2023]
    Nyckelord :WebAssembly; wasm; SIMD; multithreading; performance;

    Sammanfattning : JavaScript has been the de-facto standard programming language for Web browsers for some time. Although it has enabled the interactive and complex web pages we have today, it has long been characterized by performance issues. A promising new technology, WebAssembly, aims to enable near-native performance on the Web. LÄS MER

  3. 2. Introducing Machine Learning in a Vectorized Digital Signal Processor

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

    Författare :Linnéa Ridderström; [2023]
    Nyckelord :Digital Signal Processor DSP ; Application-Specific Integrated Circuit ASIC ; Machine Learning; Deep Learning; Convolutional Neural Network CNN ; Very Long Instruction Word VLIM ; Single Instruction Multiple Data SIMD ; Digital Signalprocessor DSP ; Applikation-Specifik Integrerad Krets ASIC ; Maskininlärning; Djupinlärning; Konvolutionella Neurala Nätverk CNN ; Very Long Instruction Word VLIW ; Single Instruction Multiple Data SIMD ;

    Sammanfattning : Machine learning is rapidly being integrated into all areas of society, however, that puts a lot of pressure on resource costraint hardware such as embedded systems. The company Ericsson is gradually integrating machine learning based on neural networks, so-called deep learning, into their radio products. LÄS MER

  4. 3. Vectorization of the Jacobi method with single- and multiple right-hand sides

    Kandidat-uppsats, Lunds universitet/Matematikcentrum; Lunds universitet/Matematik (naturvetenskapliga fakulteten)

    Författare :Patrik Paaso; [2022]
    Nyckelord :C ; Vectorization; SIMD; DUNE; VCL; Vc; Jacobi method; Jacobi iteration; discrete Poisson s equation; Stationary iterative methods; Computational science; Optimization; Numerical analysis; Mathematics and Statistics;

    Sammanfattning : Vectorization has been an important consideration for scientific com- puting performance for a long time. Early super computers were designed around vectorization, the so called ”vector computers”, but recent trends point toward favouring other computer architectures, and vector comput- ers are much more rare than they used to be. LÄS MER

  5. 4. Geographical inequalities in burden of disease at local authority level in Scotland: A subnational analysis for the Scottish Burden of Disease Study 2016

    Master-uppsats, Lunds universitet/Socialmedicin och global hälsa

    Författare :Georgia Dyer; [2020]
    Nyckelord :Burden of disease; disability-adjusted life years; years of life lost; years lived with a disability; Scottish Index of Multiple Deprivation; local authorities; Scotland; Medicine and Health Sciences;

    Sammanfattning : Background: Scotland possesses the worst mortality outcomes and slowest improvement in life expectancy of Western Europe. Within Scotland, stark inequalities exist in both morbidity and mortality. There remains paucity in assessment of subnational variation in disease burden. LÄS MER

  7. 5. Idiom-driven innermost loop vectorization in the presence of cross-iteration data dependencies in the HotSpot C2 compiler

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :William Sjöblom; [2020]
    Nyckelord :compiler; vectorization; SIMD; Java; HotSpot; code optimization; reductions; prefix sums; parallel programming; data-level parallelism;

    Sammanfattning : This thesis presents a technique for automatic vectorization of innermost single statement loops with a cross-iteration data dependence by analyzing data-flow to recognize frequently recurring program idioms. Recognition is carried out by matching the circular SSA data-flow found around the loop body’s φ-function against several primitive patterns, forming a tree representation of the relevant data-flow that is then pruned down to a single parameterized node, providing a high-level specification of the data-flow idiom at hand used to guide algorithmic replacement applied to the intermediate representation. LÄS MER