Sökning: "execution algorithms."

Visar resultat 1 - 5 av 238 uppsatser innehållade orden execution algorithms..

  1. 1. XZDDF Bootstrapping in Fully Homomorphic Encryption

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Simon Ljungbeck; [2024]
    Nyckelord :Fully Homomorphic Encryption; Homomorphic Encryption; Bootstrapping; Blind Rotation; XZDDF; Technology and Engineering;

    Sammanfattning : Despite the vast research on the topic in recent years, fully homomorphic encryption schemes remain time-inefficient. The main bottleneck is the so-called bootstrapping, whose purpose is to reduce noise that has accumulated after having performed homomorphic operations on a ciphertext. LÄS MER

  3. 2. Optimizing Quantum Computer Simulations With Data Compression & GPU Acceleration

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

    Författare :Erik Ljung; Darko Petrov; Felix Bråberg; Björn Forssén; Beata Ringmar; Jonas Hedlund; [2023-03-03]
    Nyckelord :;

    Sammanfattning : Simulating quantum computers involves high memory usage and often long execution times. For that reason the purpose of this project was to analyze whether data compression and GPU acceleration can be used to run simulations with more qubits than previously allowed. LÄS MER

  4. 3. Enhancing Privacy in Cookieless Web Advertising : A Comparative Study of Multi-Party Computation and Trusted Execution Environment Solutions for Private Attribution Reporting

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

    Författare :Victor Massy; [2023]
    Nyckelord :Multiparty computation; Trusted execution envrionment; Web advertising; Private attribution reporting; Flerpartsberäkning; Pålitlig exekveringsmiljö; Webannonsering; Privat attributionsrapportering;

    Sammanfattning : The end of third-party cookies has driven the advertising market to seek new solutions. Third-party cookies were widely used to track users’ online activities across websites. However, the growing concern for privacy has led web browsers to put an end to this practice. LÄS MER

  5. 4. A Conjugate Residual Solver with Kernel Fusion for massive MIMO Detection

    Master-uppsats, Högskolan i Halmstad/Centrum för forskning om tillämpade intelligenta system (CAISR)

    Författare :Ioannis Broumas; [2023]
    Nyckelord :MIMO; massive MIMO; GPU; CUDA; Software Defined Radio; SDR; MMSE; ZF; zero-forcing; parallel detection; iterative methods; conjugate residual; parallel computing; kernel fusion;

    Sammanfattning : This thesis presents a comparison of a GPU implementation of the Conjugate Residual method as a sequence of generic library kernels against implementations ofthe method with custom kernels to expose the performance gains of a keyoptimization strategy, kernel fusion, for memory-bound operations which is to makeefficient reuse of the processed data. For massive MIMO the iterative solver is to be employed at the linear detection stageto overcome the computational bottleneck of the matrix inversion required in theequalization process, which is 𝒪(𝑛3) for direct solvers. LÄS MER

  7. 5. Dynamic container orchestration for a device-cloud continuum

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

    Författare :Camilo Alfonso Rodriguez Garzon; [2023]
    Nyckelord :Edge computing; kubernetes operator; dynamic scheduling; Edge computing; Kubernetes-operatör; dynamisk schemaläggning;

    Sammanfattning : Edge computing has emerged as a paradigm to support the growing demand for real-time processing of data generated at the edge of the network. As the devices at the edge are constrained, one of the challenges in the area is how to schedule workloads. LÄS MER