Sökning: "uppsnabbning"

Visar resultat 6 - 10 av 11 uppsatser innehållade ordet uppsnabbning.

  1. 6. Performance Optimisation of Discrete-Event Simulation Software on Multi-Core Computers

    Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Alain E. Kaeslin; [2016]
    Nyckelord :cache hierarchy; caches; communication overhead; data structures; discrete-event simulation; heap memory; linear speedup; logistic support; low-overhead profiler; memory allocator; microarchitecture; microarchitecture analysis; multi-core; optimisation; parallel execution; profiler; runtime; scalability; scalability bottlenecks; scalable memory allocator; simulation; translation lookaside buffer; translation lookaside buffer thrashing; TLB;

    Sammanfattning : SIMLOX is a discrete-event simulation software developed by Systecon AB for analysing logistic support solution scenarios. To cope with ever larger problems, SIMLOX's simulation engine was recently enhanced with a parallel execution mechanism in order to take advantage of multi-core processors. LÄS MER

  3. 7. Implied Constraints for the Unison Presolver

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Erik Ekström; [2015]
    Nyckelord :;

    Sammanfattning : Unison is a compiler back-end that differs from traditional compiler approaches in that the compilation is carried out using constraint programming rather than greedy algorithms. The compilation problem is translated to a constraint model and then solved using a constraint solver, yielding an approach that has the potential of producing optimal code. LÄS MER

  4. 8. Factoring integers with parallel SAT solvers

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Daniel Lundén; Erik Forsblom; [2015]
    Nyckelord :;

    Sammanfattning : Factoring integers is a well known problem that at present cannot be solved in polynomial time. Therefore, other approaches for solving factorization problems are of interest. One such approach is to reduce factorization to SAT and solve it with a dedicated SAT solver. LÄS MER

  5. 9. GPU Simulation of Rigid Fibers

    Master-uppsats, KTH/Numerisk analys, NA

    Författare :Erik Wolter; [2015]
    Nyckelord :;

    Sammanfattning : The major objective of this Master's thesis is to accelerate a serial implementation of a numerical algorithm for the simulation of slender fiber dynamics by using Graphical Processing Units (GPU). We focus on rigid fibers sedimenting due to gravity in a free-space Stokes flow. LÄS MER

  7. 10. A comparative analysis between parallel models in C/C++ and C#/Java : A quantitative comparison between different programming models on how they implement parallism

    Kandidat-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Göran Angelo Kaldéren; From Anton; [2013]
    Nyckelord :;

    Sammanfattning : Parallel programming is becoming more common in software development with the popularity of multi core processors on the rise. Today there are many people and institutes that develop parallel programming APIs for already existing programming languages. LÄS MER