Sökning: "prefetching"

Visar resultat 1 - 5 av 30 uppsatser innehållade ordet prefetching.

  1. 1. Optimizing on-chip Machine Learning for Data Prefetching

    Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Hampus Larsson; Miranda Jernberg; Albin Pansell; Fabian Stigsson; Fredrik Hamrefors; Pontus Söderström; [2023-03-03]
    Nyckelord :Data Prefetching; Machine Learning; HW SW co-Design; HLS; FPGA;

    Sammanfattning : The idea behind data prefetching is to speed up program execution by predicting what data is needed by the processor, before it is actually needed. Data prefetching is commonly performed by prefetching the next memory address in line, but there are other, more sophisticated approaches such as machine learning. LÄS MER

  3. 2. Evaluation of Memory Prefetching Techniques for Modem Applications

    Master-uppsats, Linköpings universitet/Datorteknik

    Författare :Gustav Nyholm; [2022]
    Nyckelord :cache; prefetching;

    Sammanfattning : Processor performance has increased far faster than memories have been able to keep up with, forcing processor designers to use caches in order to bridge the speed difference. This can increase performance significantly for programs that utilize the caches efficiently but results in significant performance penalties when data is not in cache. LÄS MER

  4. 3. AXI-PACK : Near-memory Bus Packing for Bandwidth-Efficient Irregular Workloads

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

    Författare :Chi Zhang; [2022]
    Nyckelord :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.;

    Sammanfattning : 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. LÄS MER

  5. 4. How software prefetching affects transactional memory applications with high commit ratio

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Max Gabrielsson; [2022]
    Nyckelord :;

    Sammanfattning : Transactional Memory is a concurrency control model that allows programmers to write code that access shared data consistently by marking sequential multi-operation regions as atomic transactions. While transactions make programming easier, the lack of progress guarantees as well as the cost of re-executing a conflicting transaction leaves room for improvement. LÄS MER

  7. 5. FPGA Implementation of Feature Matching in ORB-SLAM2

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Hannah Lindström; [2022]
    Nyckelord :Autonomous navigation; SLAM; Feature matching; FPGA; ORB; Heterogeneous binary tree; Technology and Engineering;

    Sammanfattning : Simultaneous Localization And Mapping (SLAM) is an important component in solving the problem of autonomous navigation — allowing machines such as selfdriving cars and mobile robots to find their way in the world without human instruction. Though there is a steadily growing body of literature in the field of SLAM, far fewer works currently address using hardware acceleration to speed up this computationally heavy task. LÄS MER