Sökning: "cache memory"

Visar resultat 1 - 5 av 93 uppsatser innehållade orden cache memory.

  1. 1. A Study of the Reuse-Distance Behavior of Instructions

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

    Författare :Eduard Ispas; [2023]
    Nyckelord :;

    Sammanfattning : Cache replacement policies play a critical role in optimizing the performance of cache memory in computer systems. While policies like Least Recently Used (LRU) are popular, they have proven to be inefficient under certain circumstances. LÄS MER

  3. 2. En prestandajämförelse mellan objektorienterad design och dataorienterad design i C++, Java och Java Project Valhalla

    M1-uppsats, KTH/Hälsoinformatik och logistik

    Författare :Andreas Isacsson; Christopher Renström; [2023]
    Nyckelord :Project Valhalla; primitive classes; Java; C ; data-oriented design; object-oriented design; cache; TLB; Project Valhalla; primitiva klasser; Java; C ; dataorienterad design; objektorienterad design; cacheminne; TLB;

    Sammanfattning : Datorspel behöver utnyttja hårdvara effektivt för att kunna vara tillgänglig på så många system som möjligt med varierande kapacitet. En viktig del i detta är att optimera användandet av processorns cacheminnen. Programmerare kan följa en dataorienterad design för att implementera cacheeffektiv kod. LÄS MER

  4. 3. A General Purpose Near Data Processing Architecture Optimized for Data-intensive Applications

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

    Författare :Xingda Li; Haidi Hu; [2023]
    Nyckelord :Technology and Engineering;

    Sammanfattning : In recent years, as Internet of Things (IoT) and machine learning technologies have advanced, there has been increasing interest in the study of energy-efficient and flexible architectures for embedded systems. To bridge the performance gap between microprocessors and memory systems, Near-Data Processing (NDP) was introduced. LÄS MER

  5. 4. Cache behaviour analysis for graph algorithms

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

    Författare :Johan Söderström; [2023]
    Nyckelord :;

    Sammanfattning : Graph processing is an ever-increasing significant area of research in the wake of the demand for efficient tools that process data such as graphs, which can describe sets of objects (vertices) and their relations to each other (edges). Graph algorithms traverse these graphs by visiting their vertices or additionally calculating some properties about them such as how significant a specific vertex is in the context of the greater graph. LÄS MER

  7. 5. CLIENT-SIDE CACHING: REDUCING SERVER LOAD AND LATENCY IN A NETWORK TRAFFIC ANALYSIS TOOL

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Oskar Södermark; [2023]
    Nyckelord :Caching; client-side cache implementation; cache deployment; partially repeated queries; cache placement investigation; client-side cache; reducing latency; reducing server load;

    Sammanfattning : Caching is a fundamental technique widely used in the field of computing to reduce network traffic, server load, and latency. Storing frequently accessed data in a high-speed cache layer can make future requests process faster by involving fewer system components when generating and serving the response. LÄS MER