Essays about: "speedup"

Showing result 21 - 25 of 132 essays containing the word speedup.

  1. 21. AXI-PACK : Near-memory Bus Packing for Bandwidth-Efficient Irregular Workloads

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Chi Zhang; [2022]
    Keywords : General propose processor; on-chip bus protocol; irregular memory access; ASIC digital circuit design.; Generellt förslag på processor; on-chip-bussprotokoll; oregelbunden minnesåtkomst; digital ASIC-kretsdesign.;

    Abstract : General propose processor (GPP) are demanded high performance in dataintensive applications, such as deep learning, high performance computation (HPC), where algorithm kernels like GEMM (general matrix-matrix multiply) and SPMV (sparse matrix-vector multiply) kernels are intensively used. The performance of these data-intensive applications are bounded with memory bandwidth, which is limited by computing & memory access coupling and memory wall effect. READ MORE

  3. 22. Analysis, Implementation and Evaluation of Direction Finding Algorithms using GPU Computing

    University essay from Linköpings universitet/Institutionen för datavetenskap

    Author : Regina Andersdotter; [2022]
    Keywords : GPU; GPU Computing; Direction Finding; GPU Suitability; CUDA; Multiple Signal Classification; Weighted Subspace Fitting; Correlative Interferometer; runtime; angle resolution; block size;

    Abstract : Direction Finding (DF) algorithms are used by the Swedish Defence Research Agency (FOI) in the context of electronic warfare against radio. Parallelizing these algorithms using a Graphics Processing Unit (GPU) might improve performance, and thereby increase military support capabilities. READ MORE

  4. 23. Improving relocation performance in ZGC by identifying the size of small objects

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Jinyu Yu; [2022]
    Keywords : Garbage Collector; Java; Data locality; Garbage Collector; Java; Datalokalitet;

    Abstract : Modern Garbage Collectors provide performance improvements by increasing program locality to utilize the faster CPU cache. A common approach is to move objects together according to the mutators’ access order, which brings more relocations during GC. READ MORE

  5. 24. On Embarrassingly Parallel Max- Min Ant Colony Optimization for Traveling Salesperson Problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Mohamed Mohsin; Ajanth Thangavelu; [2021]
    Keywords : ;

    Abstract : Ant Colony Optimization (ACO) is a technique which can be used to find approximate Hamilton cycles for the Traveling Salesperson Problem (TSP). OpenMP is a framework which suites well for building multithreaded applications. READ MORE

  6. 25. Improving performance of BWA alignment of short sequences with coroutines

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : David Jonsson; [2021]
    Keywords : ;

    Abstract : For the Burrows-Wheeler Aligner (BWA), previous experimentation has shown that alignment of short sequences (reads) can benefit fromincreased instruction level parallelism (ILP) using hyperthreading.This thesis investigates and demonstrates that one can increase the performance of short read alignemnt with BWA without hyperthreading enabled, by employing coroutines in order to increase ILP. READ MORE