Sökning: "GPU acceleration"
Visar resultat 1 - 5 av 38 uppsatser innehållade orden GPU acceleration.
1. Optimizing Quantum Computer Simulations With Data Compression & GPU Acceleration
Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : 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
2. High-Performance Network Data Transfers to GPU : A Study of Nvidia GPU Direct RDMA and GPUNetIO
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : This study investigates high-performance network data transfers, focusing on Nvidia Graphics Processing Unit (GPU) Direct Remote Direct Memory Access (RDMA) and GPUNetIO. These methods have emerged as promising strategies for improving data communication between GPUs and network interfaces, but harnessing their potential requires meticulous configuration and optimization. LÄS MER
3. Parallelization of boolean operations for CAD Software using WebGPU
Master-uppsats, Linköpings universitet/Institutionen för datavetenskapSammanfattning : This project is about finding ways to improve performance of a Computer-Aided-Design (CAD) application running in the web browser. With the new Web API WebGPU, it is now possible to use the GPU to accelerate calculations for CAD applications in the web. LÄS MER
4. Accelerating a Molecular Docking Application by Leveraging Modern Heterogeneous Computing Systems
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : In drug development, molecular docking methods aim at characterizing the binding of a drug-like molecule to a protein. In a typical drug development process, a docking task is repeated millions of time, which makes optimization efforts essential. LÄS MER
5. A GPU Implementation of Kinodynamic Path Planning in Large Continuous Costmap Environments : Using Dijkstra's Algorithm and Simulated Annealing
Master-uppsats, Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)Sammanfattning : Path planning that takes kinodynamic constraints into account is a crucial part of critical missions where autonomous vehicles must function independently without communication from an operator as this ensures that the vehicle will be able to follow the planned path. In this thesis, an algorithm is presented that can plan kinodynamically feasible paths through large scale continuous costmap environments for different constraints on the maximum allowed acceleration and jerk along the path. LÄS MER