Dissertations / Theses on the topic 'GPU Accelerated'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'GPU Accelerated.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Lionetti, Fred. "GPU accelerated cardiac electrophysiology." Diss., [La Jolla] : University of California, San Diego, 2010. http://wwwlib.umi.com/cr/ucsd/fullcit?p1474756.
Full textTitle from first page of PDF file (viewed April 14, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 85-89).
Mäkelä, J. (Jussi). "GPU accelerated face detection." Master's thesis, University of Oulu, 2013. http://urn.fi/URN:NBN:fi:oulu-201303181103.
Full textGrafiikkaprosessorit kykenevät massiiviseen rinnakkaislaskentaan ja niiden käyttö yleiseen laskentaan on kasvava kiinnostuksen aihe. Eräs alue missä kiihdytyksen käytöstä on kiinnostuttu on laskennallisesti raskaat konenäköalgoritmit kuten kasvojen ilmaisu ja tunnistus. Kasvojen ilmaisua käytetään useissa sovelluksissa, kuten kameroiden automaattitarkennuksessa, kasvojen ja tunteiden tunnistuksessa sekä kulun valvonnassa. Tässä työssä kasvojen ilmaisualgoritmia kiihdytettiin grafiikkasuorittimella käyttäen OpenCL-rajapintaa. Työn tavoite oli parantunut suorituskyky kuitenkin niin että implementaatiot pysyivät toiminnallisesti samanlaisina. OpenCL-versio perustui optimoituun verrokki-implementaatioon. Algoritmin eri vaiheiden kiihdytyksen mahdollisuuksia ja haasteita on tutkittu. Kiihdytetty- ja verrokki-implementaatio kuvaillaan ja niiden välistä suorituskykyeroa vertaillaan. Suorituskykyä arvioitiin ajoaikojen perusteella. Testeissä käytettiin kolmea kuvasarjaa joissa jokaisessa oli neljä eri kokoista kuvaa sekä kolmea lisäkuvaa jotka kuvastivat erikoistapauksia. Testit ajettiin kahdella erilailla varustellulla tietokoneella. Tuloksista voidaan nähdä että kasvojen ilmaisu soveltuu hyvin GPU kiihdytykseen, sillä algoritmin pystyy rinnakkaistamaan ja siinä pystyy käyttämään tehokasta tekstuurinkäsittelylaitteistoa. OpenCL-ympäristön alustaminen aiheuttaa viivettä joka vähentää jonkin verran suorituskykyetua. Testeissä todettiin kiihdytetyn implementaation antavan saman suuruisen tai jopa pienemmän suorituskyvyn kuin verrokki-implementaatio sellaisissa tapauksissa, joissa laskentaa oli vähän johtuen joko pienestä tai helposti käsiteltävästä kuvasta. Toisaalta kiihdytetyn implementaation suorituskyky oli hyvä verrattuna verrokki-implementaatioon kun käytettiin suuria ja monimutkaisia kuvia. Tulevaisuudessa OpenCL-ympäristön alustamisen aiheuttamat viivettä tulisi saada vähennettyä. Tämä työ on kiinnostava myös tulevaisuudessa kun OpenCL-kiihdytys tulee mahdolliseksi matkapuhelimissa
Graves, Alex. "GPU-Accelerated Feature Tracking." Wright State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=wright1462372516.
Full textBaravdish, Gabriel. "GPU Accelerated Light Field Compression." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-150558.
Full textKottravel, Sathish. "GPU accelerated Nonlinear Soft Tissue Deformation." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-76895.
Full textEdespong, Erik. "GPU Accelerated Surface Reconstruction from Particles." Thesis, Linköpings universitet, Institutionen för teknik och naturvetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-93543.
Full textBASTOS, THIAGO DE ALMEIDA. "GPU-ACCELERATED ADAPTIVELY SAMPLED DISTANCE FIELDS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=12160@1.
Full textShape representation is a fundamental problem in Computer Graphics. Among known representations for three-dimensional objects, adaptively sampled distance fields (ADFs) are noted for their versatility. ADFs combine the concepts of geometry with volume data, allow objects to be represented with arbitrary precision, and consolidate several operations - such as visualization, level-of-detail modeling, collision detection, proximity tests, morphing and boolean operations | into a single representation. This work proposes methods to accelerate the reconstruction of static ADFs, to improve the quality of reconstructed fields, and to visualize ADF isosurfaces, making use of the massive computational power found in modern graphics hardware (GPUs). In order to effciently represent ADFs on graphics cards, a hierarchical structure based on perfect spatial hashing is proposed. Rendering of ADFs is done completely on GPUs, using a ray casting technique based on sphere tracing. Means to overcome the C0 and C1 discontinuities inherent to ADFs are suggested in order to attain smoothly shaded iso-surfaces. Finally, a new reconstruction method for ADFs, which can better represent curved surfaces, is proposed. Results are presented through simple interactive visualization applications, with ADFs generated from both triangle meshes and primitive solids.
Zhao, Kaiyong. "GPU accelerated sequence alignment /Zhao Kaiyong." HKBU Institutional Repository, 2016. https://repository.hkbu.edu.hk/etd_oa/378.
Full textSchmitt, Ryan Daniel. "GPU-Accelerated Point-Based Color Bleeding." DigitalCommons@CalPoly, 2012. https://digitalcommons.calpoly.edu/theses/810.
Full textPettersson, Niklas. "GPU-Accelerated Real-Time Surveillance De-Weathering." Thesis, Linköpings universitet, Datorseende, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-97401.
Full textPrestegård, Elisabeth K. "A GPU Accelerated Simulator for CO2 Storage." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for fysikk, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-24542.
Full textPachev, Ivan. "GPUMap: A Transparently GPU-Accelerated Map Function." DigitalCommons@CalPoly, 2017. https://digitalcommons.calpoly.edu/theses/1704.
Full textArvid, Johnsson. "Analysis of GPU accelerated OpenCL applications on the Intel HD 4600 GPU." Thesis, Linköpings universitet, Programvara och system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-140124.
Full textLagergren, Mattias. "GPU accelerated SPH simulation of fluids for VFX." Thesis, Linköping University, Visual Information Technology and Applications (VITA), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57320.
Full textHrstic, Dusan Viktor. "Improving the performance of GPU-accelerated spatial joins." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210719.
Full textDatakollisioner har studerats i stor utsträckning i olika områden inom vetenskap och industri. Att kombinera CPU och GPU för bearbetning av rumsliga föreningar har godtagits på grund av bättre prestanda. Detta bör omdirigera insatser i GPGPU-forskning från en enkel portning av applikationer till fastställande av principer och strategier som möjliggör en effektiv användning av grafikhårdvara. Eftersom trådar som exekverar instruktioner använder sig av hårdvaruresurser, förekommer olika effekter beroende på olika trådorganisationer. Deras på verkan på prestanda av rumsliga föreningar kommer att analyseras och granskas i denna rapport. Nya perspektiv och lösningar på problemet med trådorganisationen och schemaläggning av warps kan bidra till att fler uppmuntras till att använda GPU-programmering. Syftet med denna rapport är att undersöka effekterna av olika trådorganisationer i rumsliga föreningar. Förhållandet mellan objekten inom datamängder undersöks genom att beräkna antalet kollisioner som ihopslagna datamängder förorsakar. Detta görs för att förstå hur olika metoder kan påverka effektivitet och prestanda. Prestandamätningar av olika metoder inom trå dorganisationer undersö ks och analyseras fö r att hitta den mest tidseffektiva lösningen. I denna rapport visualiseras också det erhållna resultatet av olika trådtekniker som används för att optimera beräkningshastigheterna för rumsliga föreningar. Rapporten undersökeren CPU-algoritm och två GPU-algoritmer. GPU tiderna jämförs hela tiden med exekveringstiderna på CPU:n, och GPU-implementeringarna verifieras genom att jämföra antalet kollisioner från både CPU:n och GPU:n. Under analysdelen av rapporten jämförs och diskuteras olika implementationer med varandra. Det visade sig att skillnaden mellan en algoritm som implementerar trådtekniker och en icke-optimerad version är cirka 80 % till förmån för algoritmen som implementerar trådtekniker. Det visade sig också föreningarna på CPU:n att den är runt 56 gånger snabbare än de rumsliga
Young, Emily Clark. "GPU-Accelerated Demodulation for a Satellite Ground Station." DigitalCommons@USU, 2019. https://digitalcommons.usu.edu/etd/7635.
Full textQvick, Faxå Alexander, and Jonas Bromö. "GPU accelerated rendering of vector based maps on iOS." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-107064.
Full textKienel, Enrico, and Guido Brunnett. "GPU-Accelerated Contour Extraction on Large Images Using Snakes." Universitätsbibliothek Chemnitz, 2009. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200900358.
Full textBrodén, Alexander, and Bohlin Gustav Pihl. "Towards Real-Time NavMesh Generation Using GPU Accelerated Scene Voxelization." Thesis, Blekinge Tekniska Högskola, Institutionen för kreativa teknologier, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14381.
Full textLiu, Bingchen, Alexander Bock, Timo Ropinski, Martyn Nash, Poul Nielsen, and Burkhard Wünsche. "GPU-Accelerated Direct Volume Rendering of Finite Element Data Sets." Linköpings universitet, Medie- och Informationsteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-92854.
Full textCluff, Stephen T. "A unified approach to GPU-accelerated aerial video enhancement techniques /." Diss., CLICK HERE for online access, 2009. http://contentdm.lib.byu.edu/ETD/image/etd2780.pdf.
Full textSreenibha, Reddy Byreddy. "Performance Metrics Analysis of GamingAnywhere with GPU accelerated Nvidia CUDA." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-16846.
Full textCluff, Stephen Thayn. "A Unified Approach to GPU-Accelerated Aerial Video Enhancement Techniques." BYU ScholarsArchive, 2009. https://scholarsarchive.byu.edu/etd/1680.
Full textUlmstedt, Mattias, and Joacim Stålberg. "GPU Accelerated Ray-tracing for Simulating Sound Propagation in Water." Thesis, Linköpings universitet, Datorteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160308.
Full textLiberg, Tim, and Per-Erik Måhl. "GPU-accelerated Model Checking of Periodic Self-Suspending Real-Time Tasks." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-14661.
Full textNottingham, Alastair Timothy. "GPU Accelerated protocol analysis for large and long-term traffic traces." Thesis, Rhodes University, 2016. http://hdl.handle.net/10962/910.
Full textZhang, Yun. "LARGE-SCALE MICROARRAY DATA ANALYSIS USING GPU- ACCELERATED LINEAR ALGEBRA LIBRARIES." OpenSIUC, 2012. https://opensiuc.lib.siu.edu/theses/878.
Full textTasoulas, Zois Gerasimos. "Resource management and application customization for hardware accelerated systems." OpenSIUC, 2021. https://opensiuc.lib.siu.edu/dissertations/1907.
Full textHamed, Maien Mohamed Osman. "On meshless methods : a novel interpolatory method and a GPU-accelerated implementation." Thesis, Nelson Mandela Metropolitan University, 2013. http://hdl.handle.net/10948/d1018227.
Full textde, Ruiter Niels Johannes Antonius. "GPU Accelerated Intermixing as a Framework for Interactively Visualizing Spectral CT Data." Thesis, University of Canterbury. Centre of Bioengineering, 2011. http://hdl.handle.net/10092/5328.
Full textZhang, Chenggang, and 张呈刚. "Run-time loop parallelization with efficient dependency checking on GPU-accelerated platforms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47167658.
Full textpublished_or_final_version
Computer Science
Master
Master of Philosophy
Ntemos, George. "GPU-accelerated high-order scale-resolving simulations using the flux reconstruction approach." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/59135.
Full textDyson, Joshua. "GPU accelerated linear system solvers for OpenFOAM and their application to sprays." Thesis, Brunel University, 2018. http://bura.brunel.ac.uk/handle/2438/16005.
Full textEs, S. Alphan. "Accelerated Ray Tracing Using Programmable Graphics Pipelines." Phd thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609307/index.pdf.
Full textMantell, Rosemary Genevieve. "Accelerated sampling of energy landscapes." Thesis, University of Cambridge, 2017. https://www.repository.cam.ac.uk/handle/1810/267990.
Full textTarassu, Jonas. "GPU-Accelerated Frame Pre-Processing for Use in Low Latency Computer Vision Applications." Thesis, Linköpings universitet, Informationskodning, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-142019.
Full textTong, Jason. "Providing an infrastructure for assertion-based test generation and GPU accelerated mutation testing." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=123078.
Full textLa vérification fonctionnelle de circuits numériques modernes comporte des défis sans fin dans l'industrie des circuits intégrés (CI). Alimentés par la demande continue d'intégration croissante, les efforts grandissants en vérification ne mènent pas toujours à des circuits sans erreur du premier coup. Une technologie émergente telle que la vérification par assertions peut aider à vérifier le bon fonctionnement des circuits numériques et peut être facilement intégrée aux méthodologies de vérification existantes. La simulation fonctionnelle représente toujours la méthode de vérification laplus répandue dans l'industrie, étant donné sa capacité à traiter des circuits plus volumineux. Les assertions peuvent être insérées dans un circuit et peuvent aussi servir comme repères de couverture, pour lesquels les tests d'entrée ont la responsabilité d'exercer le circuit évaluant ces assertions. L'efficacité de cette approche repose sur la qualité des tests, car de piètres tests peuvent empêcher une vérification complète. Cette thèse présente des techniques et algorithmes novateurs ayant pour but de produire des tests à partir des assertions. En raison des comportements qu'elles décrivent, les assertions représentent une source importante d'information permettant d'extraire des séries de tests fonctionnels, pouvant servir lors de la simulation. Un ensemble de métriques de couverture aide à produire des tests qui évaluent rigoureusement les assertions durant la simulation. Les ingénieurs en vérification peuvent ainsi utiliser ces tests pour effectuer des simulations efficaces dans le but de détecter et corriger des erreurs de conception. L'outil servant à générer des tests à partir des assertions qui a été développé fut évalué avec près de 300 assertions créées dans le but de vérifier le bon fonctionnement de plusieurs circuits industriels. Sur le plan des résultats, l'approche de génération de test proposée a été capable de produire des tests supplémentaires menant à une couverture de test améliorée comparativement à un générateur de test d'une autre équipe de recherche.Le test par mutation est une technique permettant d'évaluer la qualité des tests découlant des assertions. Les simulations de mutations exigent une grande puissance de calcul. Basés sur des processeurs graphiques (GPU), cette thèse présente aussi des algorithmes novateurs dans le domaine des tests par mutations. Sur une série de 10 circuits industriels, les résultats expérimentaux démontrent une amélioration importante de la performance de simulation comparativement à un outil commercial. Cette amélioration des performances est nécessaire étant donné l'accélération de calcul requise pour évaluer la qualité des tests lors de simulations de plusieurs mutations. Cela a un impact bénéfique dans la quête visant à améliorer la qualité des assertions, menant ultimement vers une vérification dynamique efficace de circuits numériques.
Phillips, Adam. "GPU Accelerated Approach to Numerical Linear Algebra and Matrix Analysis with CFD Applications." Honors in the Major Thesis, University of Central Florida, 2014. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1635.
Full textB.S.
Bachelors
Mathematics
Sciences
Zhang, Michael Longqiang. "A partitioning approach for GPU accelerated level-based on-chip variation static timing analysis." Diss., [La Jolla] : University of California, San Diego, 2010. http://wwwlib.umi.com/cr/fullcit?p1477953.
Full textTitle from first page of PDF file (viewed July 16, 2010). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (leaves 52-53).
Pinska, Adrianna. "Addition of flexible linkers to GPU-accelerated coarse-grained simulations of protein-protein docking." Thesis, Faculty of Science, 2019. http://pubs.cs.uct.ac.za/archive/00001307/.
Full textRen, Qinlong, and Qinlong Ren. "GPU Accelerated Study of Heat Transfer and Fluid Flow by Lattice Boltzmann Method on CUDA." Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/621746.
Full textCheng, Wei-Hung. "MRI-Based Images Segmentation for GPU Accelerated Fuzzy Methods on Graphics Processing Units by CUDA." Kent State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=kent154349822159698.
Full textSelke, Gunnar [Verfasser], and Dietmar P. F. [Akademischer Betreuer] Möller. "Design and Development of a GPU-Accelerated Micromagnetic Simulator / Gunnar Selke. Betreuer: Dietmar P. F. Möller." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2014. http://d-nb.info/1051435609/34.
Full textKelly, Jesse. "Numerical solution of the two-phase incompressible navier-stokes equations using a gpu-accelerated meshless method." Honors in the Major Thesis, University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1277.
Full textBachelors
Engineering and Computer Science
Mechanical Engineering
Hellmich, Stephan [Verfasser], and Tilman [Akademischer Betreuer] Spohn. "GPU accelerated n-body integrators for long-term simulations of planetary systems / Stephan Hellmich ; Betreuer: Tilman Spohn." Münster : Universitäts- und Landesbibliothek Münster, 2018. http://d-nb.info/1159955867/34.
Full textPacura, Dávid. "Hardware Accelerated Digital Image Stabilization in a Video Stream." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255435.
Full textCaplan, Ronald Meyer. "Study of Vortex Ring Dynamics in the Nonlinear Schrödinger Equation Utilizing GPU-Accelerated High-Order Compact Numerical Integrators." Scholarship @ Claremont, 2012. http://scholarship.claremont.edu/cgu_etd/52.
Full textRémy, Adrien. "Solving dense linear systems on accelerated multicore architectures." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112138/document.
Full textIn this PhD thesis, we study algorithms and implementations to accelerate the solution of dense linear systems by using hybrid architectures with multicore processors and accelerators. We focus on methods based on the LU factorization and our code development takes place in the context of the MAGMA library. We study different hybrid CPU/GPU solvers based on the LU factorization which aim at reducing the communication overhead due to pivoting. The first one is based on a communication avoiding strategy of pivoting (CALU) while the second uses a random preconditioning of the original system to avoid pivoting (RBT). We show that both of these methods outperform the solver using LU factorization with partial pivoting when implemented on hybrid multicore/GPUs architectures. We also present new solvers based on randomization for hybrid architectures for Nvidia GPU or Intel Xeon Phi coprocessor. With this method, we can avoid the high cost of pivoting while remaining numerically stable in most cases. The highly parallel architecture of these accelerators allow us to perform the randomization of our linear system at a very low computational cost compared to the time of the factorization. Finally we investigate the impact of non-uniform memory accesses (NUMA) on the solution of dense general linear systems using an LU factorization algorithm. In particular we illustrate how an appropriate placement of the threads and data on a NUMA architecture can improve the performance of the panel factorization and consequently accelerate the global LU factorization. We show how these placements can improve the performance when applied to hybrid multicore/GPU solvers
Riesinger, Christoph [Verfasser], Hans-Joachim [Akademischer Betreuer] [Gutachter] Bungartz, and Takayuki [Gutachter] Aoki. "Scalable scientific computing applications for GPU-accelerated heterogeneous systems / Christoph Riesinger ; Gutachter: Hans-Joachim Bungartz, Takayuki Aoki ; Betreuer: Hans-Joachim Bungartz." München : Universitätsbibliothek der TU München, 2017. http://d-nb.info/1138787892/34.
Full textTollefson, Mallory RaNae. "Accelerated many-body protein side-chain repacking using gpus: application to proteins implicated in hearing loss." Thesis, University of Iowa, 2017. https://ir.uiowa.edu/etd/6006.
Full text