Sökning: "Speedup"

Visar resultat 1 - 5 av 136 uppsatser innehållade ordet Speedup.

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

  3. 2. Analysis and optimization of an implementation of hierarchical Tucker tensors

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

    Författare :Daniel Wallgren; [2023]
    Nyckelord :;

    Sammanfattning : The hierarchical Tucker tensor format is a format for approximated tensors which has been decomposed into smaller parts. This structure can be useful in high-dimensional computer simulations. One implementation of this structure is in a library called htlib. LÄS MER

  4. 3. The impact of pruning Convolutional Neural Networks when classifying skin cancer

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

    Författare :Gustaf Larsson; Marcus Odin; [2023]
    Nyckelord :;

    Sammanfattning : Over the past few years, there have been multiple reports showcasing how Convolutional Neural Networks (CNNs) can be used to classify if skin lesions are cancerous or non-cancerous. However, a limitation of CNNs is the large number of parameters resulting in high computation times. LÄS MER

  5. 4. Efficiently Solving the Exact Cover Problem in OpenMP

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

    Författare :Leo Hall; [2023]
    Nyckelord :Exact Cover; openmp; parallelization;

    Sammanfattning : The exact cover problem is an NP-complete problem with many widespread use cases such as crew scheduling, railway scheduling, benchmarking as well as having applications in set theory. Existing algorithms can be slow when dealing with large datasets however. LÄS MER

  7. 5. Performance Benefits of Extending JavaScript Through WASM and CUDA : A Comparative Performance Investigation

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

    Författare :Hampus Hallkvist; Edvin Nordqvist; [2023]
    Nyckelord :;

    Sammanfattning : JavaScript is today the largest language based on usage with regard to web development. There is, therefore, a great incentive to make the language perform at its best and allow applications to take advantage of this. LÄS MER