Sökning: "concurrent programming"

Visar resultat 1 - 5 av 44 uppsatser innehållade orden concurrent programming.

  1. 1. Continuous Parallel Approximate Frequent Elements Queries on Data Streams

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

    Författare :Victor Jarlow; [2021-10-06]
    Nyckelord :computer science; big data; Space-Saving; Misra-Gries summary; frequent items; frequent elements; concurrent programming; Delegation Sketch; domain splitting; Count-Min Sketch; Majority algorithm; pproximate frequent-elements algorithm; approximate top-k elements algorithm;

    Sammanfattning : The frequent elements problem involves processing a stream of elements and finding all elements that occur more than a given fraction of the time. A relaxed version of this problem is the -approximate elements problem which allows some false positives. LÄS MER

  2. 2. A JVM-Managed Concurrent Unrolled List-Based Set Using Lazy Synchronization

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

    Författare :Adam Farhadi; [2021]
    Nyckelord :Concurrent Data Structures; Linked-Lists; List-Based Sets; Samverkande datastrukturer; länkade listor; listbaserade set;

    Sammanfattning : The multicore revolution of the early 21st century has introduced a multitude of multiprocessor synchronization techniques for designing concurrent data structures. This thesis explores the concept of “unrolling”, or storing multiple data items per node, in order to increase the concurrent throughput of linked-lists, or more specifically list-based sets of linked nodes. LÄS MER

  3. 3. Comparative Study of CPU and GPGPU Implementations of the Sievesof Eratosthenes, Sundaram and Atkin

    Uppsats för yrkesexamina på avancerad nivå, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :Jakob Månsson; [2021]
    Nyckelord :General Purpose Graphics Processing Unit; Parallelization; Prime number; Sieve.;

    Sammanfattning : Background. Prime numbers are integers divisible only on 1 and themselves, and one of the oldest methods of finding them is through a process known as sieving. A prime number sieving algorithm produces every prime number in a span, usually from the number 2 up to a given number n. LÄS MER

  4. 4. Blocking violations in reactive Java frameworks

    Kandidat-uppsats, Mittuniversitetet/Institutionen för data- och systemvetenskap; 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

  5. 5. Improving Performance of a Trading System through Lock-Free Programming

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

    Författare :Harald Ng; Josef Karlsson Malik; [2018]
    Nyckelord :lock-free; concurrency; trading system; performance; atomic operations; låsfrihet; prestanda; tradingsystem; concurrency; atomiska operationer;

    Sammanfattning : Concurrent programming is a form of computing, where several computations are executed in overlapping time periods. This can improve a system’s capability of handling growing amounts of work and execute faster on multicore processors. Lock is a usual tool used to ensure shared data is handled correctly. LÄS MER