Sökning: "Cache technology"

Visar resultat 1 - 5 av 128 uppsatser innehållade orden Cache technology.

  1. 1. Cache replacement policies and their impact on graph database operations

    Master-uppsats, Lunds universitet/Institutionen för datavetenskap

    Författare :Tora Elding Larsson; Lukas Gustavsson; [2024]
    Nyckelord :Technology and Engineering;

    Sammanfattning : .... LÄS MER

  3. 2. Relaxed Priority Queue & Evaluation of Locks

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

    Författare :Andreas Rudén; Ludvig Andersson; [2023-10-23]
    Nyckelord :Concurrency; Data Structures; Algorithms; Priority Queue; Semantic Relaxation; Lock-free; Scalability; Performance;

    Sammanfattning : We present a new, lock-free and concurrent priority queue, utilizing some ideas from [1] by Rukundo et al., that relaxes the traditional sequential semantics of the delete_min operation to achieve better scalability and performance. LÄS MER

  4. 3. 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

  5. 4. 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

  7. 5. 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