Sökning: "C- LIU"

Visar resultat 1 - 5 av 560 uppsatser innehållade orden C- LIU.

  1. 1. A Study on Poset Probability

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Albin Jaldevik; [2022]
    Nyckelord :Discrete mathematics; Order theory; Combinatorics; Partially ordered set; Poset; Linear extension; Topological sorting; Probability; Partition; Young diagram;

    Sammanfattning : Let be a finite poset (partially ordered set) with cardinality . A linear extension of is an order-preserving bijection : , that is, if in then . We define the poset probability as the proportion of linear extensions where . We are primarily interested in for incomparable elements . LÄS MER

  2. 2. Extending applicability of symbolic execution to uncover possible shared memory transactions in GPU programs

    Master-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Jonathan Hjort; [2022]
    Nyckelord :;

    Sammanfattning : General-purpose computing on the graphics processing unit has become popular since the cost-to-power ratio is lower for GPUs (compared to CPUs) and the programmability of the GPU has increased. CUDA is an extension of the C/C++ programming languages which enables software developers to more easily make use of the computational power of the GPUs. LÄS MER

  3. 3. GIS Processing on the Web

    Kandidat-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Erik Knutsson; Manne Rydhe; [2022]
    Nyckelord :GIS; NodeJS; WebAssembly; Wasm; GDAL; JavaScript; SPA; GC; browsers; benchmark; memory; Ogr2Ogr;

    Sammanfattning : Today more and more advanced and demanding applications are finding their way to the web. These are applications like video editing, games, and mathematical calculations. Up until a few years ago, JavaScript was the only language present on the web. That was until Mozilla, Google, Microsoft, and Apple decided to develop WebAssembly. LÄS MER

  4. 4. Analyzing and Reducing Compilation Times for C++ Programs

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :Dennis Mivelli; [2022]
    Nyckelord :C ; Compilation; Build; Dependencies; File Dependencies; File inclusions; Time; Speed; Compilation time; Build time; Design patterns; PImpl; Bridge; Dependency injection; Pointer to implementation; Mocking; GoogleTest; gMock; large; large-scale; Reduce; Reduce compilation times; Reduce build times; C ; Kompilering; Byggtid; Beroenden; Filberoenden; Filinkluderingar; Tid; Hastighet; Kompileringstid; Designmönster; PImpl; Bridge; Dependency injection; Pointer to implementation; Mockning; Mocking; GoogleTest; gMock; Storskalig; Minska kompileringstid; Minska;

    Sammanfattning : Software companies often choose to develop in C++ because of the high performance that the language offers. Facilitated by static compilation and powerful optimization options, runtime performance is paid for with compilation time. LÄS MER

  5. 5. Performance-Aware Code Size Optimization of Generic Functions through Automatic Implementation of Dynamic Dispatch

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :Ivar Härnqvist; [2022]
    Nyckelord :Compiler technology; Programming language design; Performance; Code size optimization; Generic programming; Polymorphism; Dynamic dispatch; Type erasure; Monomorphization; Templates; C ; Kompilatorteknik; Programspråksdesign; Prestanda; Kodstorleksoptimering; Generisk programmering; Polymorfism; Dynamic dispatch; Typradering; Monomorfisering; Templates; C ;

    Sammanfattning : Monomorphization and dynamic dispatch are two common techniques for implementing polymorphism in statically typed programming languages. Function templates in C++ use the former technique to enable algorithms written as generic functions to be efficiently reused with multiple different data types by producing a separate function instantiation for each invocation that uses a unique permutation of argument types. LÄS MER