Essays about: "execution algorithms."
Showing result 1 - 5 of 228 essays containing the words execution algorithms..
-
1. XZDDF Bootstrapping in Fully Homomorphic Encryption
University essay from Lunds universitet/Institutionen för elektro- och informationsteknikAbstract : 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. READ MORE
-
2. Optimizing Quantum Computer Simulations With Data Compression & GPU Acceleration
University essay from Göteborgs universitet/Institutionen för data- och informationsteknikAbstract : 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. READ MORE
-
3. Enhancing Privacy in Cookieless Web Advertising : A Comparative Study of Multi-Party Computation and Trusted Execution Environment Solutions for Private Attribution Reporting
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE
-
4. A Conjugate Residual Solver with Kernel Fusion for massive MIMO Detection
University essay from Högskolan i Halmstad/Centrum för forskning om tillämpade intelligenta system (CAISR)Abstract : 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. READ MORE
-
5. Dynamic container orchestration for a device-cloud continuum
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE