Sökning: "interleaving"

Visar resultat 1 - 5 av 24 uppsatser innehållade ordet interleaving.

  1. 1. Revisiting the Massive Memory Machine for Processing in Memory

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

    Författare :Bulut Bulgu; Antonia Sakellariou; [2023]
    Nyckelord :;

    Sammanfattning : Many of the modern problems in computing are, due to their nature, memory-bound. This essentially means that adding more and more computing power, ie. LÄS MER

  3. 2. Examining Packet Propagation in a Tree of Switches : Via Programmatic Scripting of Mininet

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

    Författare :Georgios Tagkoulis; [2022]
    Nyckelord :packet order; packet interleaving; temporal and spatial locality; visualization; paketordning; paketinterfoliering; temporal och rumslig lokalitet; visualisering;

    Sammanfattning : Hamid Ghasemirahni, et al. have shown that the order of the network packets arrival at a datacenter, equipped with commodity servers, plays a significant role in the latency of processing these packets. LÄS MER

  4. 3. Improving performance of BWA alignment of short sequences with coroutines

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

    Författare :David Jonsson; [2021]
    Nyckelord :;

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

  5. 4. Stability of Homology-Based Invariants in Data Analysis

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Daniel Lundin; [2020]
    Nyckelord :;

    Sammanfattning : In this thesis we will study the stability of the persistent homology pipeline used in topological data analysis. In particular, we will prove that persistent homology is 2-Lipschitz with respect to the Gromov-Hausdorff distance on the space of pseudometric spaces and interleaving distance on the space of parametrised vector spaces. LÄS MER

  7. 5. Blocking violations in reactive Java frameworks

    Kandidat-uppsats, Mittuniversitetet/Institutionen för data- och systemvetenskap

    Författare :Morgan Vallin; Robin Sundström; [2020]
    Nyckelord :RxJava; Project-reactor; Concurrency Error Study; BlockHound; Reactive Programming;

    Sammanfattning : Concurrency in programming is a way of interleaving tasks in order to enhance the performance of an application. Previous research has found that concurrency errors are hard to avoid, hard to find, and that they often degrade performance of the application. LÄS MER