Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 15 of 15 for “"GPU algorithm"”.

  1. A Novel GPU Algorithm for Indexing Columnar Databases with Column Imprints

    … such as Graphical Processing Units (GPU) can be used. GPUs are co-processors that have been shown to outperform CPUs for highly parallel tasks. Besides this, GPUs are highly energy efficient, affordable, and available in many types of machines, from mobile devices to supercomputers. …

    umn Repository record for A Novel GPU Algorithm for Indexing Columnar Databases with Column Imprints (opens in a new tab)

  2. Delaunay triangulation in R3 on the GPU

    This thesis presents massively parallel algorithms to compute the 3D Delaunay triangulation efficiently and robustly on the GPU. Our CUDA implementations of these algorithms obtain a speedup of up to 6 times over comparable methods. gDel3D is a heterogeneous GPU-CPU algorithm that performs …

    nus Repository record for Delaunay triangulation in R3 on the GPU (opens in a new tab) Download file for Delaunay triangulation in R3 on the GPU (opens in a new tab)

  3. An Approach For Computing Intervisibility Using Graphical Processing U

    … between entities. This thesis presents an algorithm for performing these visibility calculations using Graphical Processing Units (GPU) instead of the Central Processing Units (CPU) that have been traditionally used in CGF simulations. This algorithm can be distributed across multiple GPUs …

    ucf Repository record for An Approach For Computing Intervisibility Using Graphical Processing U (opens in a new tab)

  4. Discrete ordinates CT organ dose simulator (DOCTORS)

    … as improved imaging techniques and processing algorithms provide higher quality information to doctors. However, the exponentially increasing usage of CT has raised concerns regarding long term low-dose radiological risks.</p><p>Currently, the dose to patients is computed using Monte Carlo …

    must-thes Repository record for Discrete ordinates CT organ dose simulator (DOCTORS) (opens in a new tab)

  5. Sparse Graph Algorithms For Analytics And Prediction Tasks

    … increasing interest in creating efficient graph algorithms and processing systems. Historically, researchers and scientists have studied the properties and the structure of graphs to design highly optimized algorithms. Many graphs that model real-world processes and systems exhibit the property …

    umn Repository record for Sparse Graph Algorithms For Analytics And Prediction Tasks (opens in a new tab)

  6. Jump flooding algorithm on graphics hardware and its applications

    The graphics processing unit (GPU) has been developing at a very fast pace these few years. More and more researches have been done to utilize the ever increasing computability power of the GPU on general-purpose computations. This thesis proposes a new GPU algorithm -- jump flooding algorithm …

    nus Repository record for Jump flooding algorithm on graphics hardware and its applications (opens in a new tab) Download file for Jump flooding algorithm on graphics hardware and its applications (opens in a new tab)

  7. GPU accelerated procedural terrain generation : a thesis presented in partial fulfilment of the requirements for the degree Master of Science in Computer Science at Massey University, Albany, New Zealand

    … and costly for human artists. Many algorithmic generation methods have been proposed as an alternative solution to manual reproduction. However, those methods are still limited when needing them to be employed in a wide range of applications. Alternatively, simulation of the stream …

    massey Repository record for GPU accelerated procedural terrain generation : a thesis presented in partial fulfilment of the requirements for the degree Master of Science in Computer Science at Massey University, Albany, New Zealand (opens in a new tab)

  8. Parallel algorithms and data structures for interactive applications

    … widespread adoption of parallel computers, many algorithms and applications have been ported to fit these new architectures. However, in unconventional applications, with interactivity and real-time requirements, achieving efficient parallelizations is still a major challenge. Real-time …

    brazil-ufrgs Repository record for Parallel algorithms and data structures for interactive applications (opens in a new tab)

  9. Efficient Viewshed Computation Algorithms On GPUs and CPUs

    … the poor performance of current exact-viewshed algorithms that may need several hours to process a midsize map, we found the need for new algorithms that are capable of efficiently computing viewshed for large size maps. This work presents a highly-efficient exact-viewshed computation algorithm …

    usf Repository record for Efficient Viewshed Computation Algorithms On GPUs and CPUs (opens in a new tab)

  10. Point Based Approximate Color Bleeding with Cuda

    … There are a wide variety of global illumination algorithms that are implemented and used by major motion picture companies to render interesting and believable scenes. Every algorithm strives to find a balance between speed and accuracy. The Point Based Approximate Color Bleeding algorithm is one …

    calpoly Repository record for Point Based Approximate Color Bleeding with Cuda (opens in a new tab)

  11. Scalable GPU Algorithms for Similarity Query Processing and Clustering on Trajectory Data

    … top-K trajectory similarity query technique for GPUs, FastTopK, to deal with these challenges. Our experiments on two large real-life datasets showed that FastTopK produces on average 107.96X smaller candidate result sets, and 3.36X faster query execution times than the existing state of-the-art …

    umn Repository record for Scalable GPU Algorithms for Similarity Query Processing and Clustering on Trajectory Data (opens in a new tab)

  12. High-Performance Computing Algorithms for Constructing Inverted Files on Emerging Multicore Processors

    … adopted on recent heterogeneous systems and GPUs respectively. The main goal of this dissertation is to develop techniques and methodologies for exploiting these emerging parallel architectures and parallel programming languages to solve large scale irregular applications such as the …

    maryland Repository record for High-Performance Computing Algorithms for Constructing Inverted Files on Emerging Multicore Processors (opens in a new tab)

  13. Systematic study of earthquake triggering using microearthquakes detected by the matched filter technique

    … larger events. To overcome this, I developed a GPU-based matched filter technique to automatically detect earthquakes through collaborations with computer scientists at Georgia Tech. If two earthquakes occur very close to each other and have similar fault slip, the resulting waveforms recorded …

    gatech Repository record for Systematic study of earthquake triggering using microearthquakes detected by the matched filter technique (opens in a new tab)

  14. Advanced Optimization Techniques For Monte Carlo Simulation On Graphics Processing Units

    … to design and implement a self-adaptive parallel GPU optimized Monte Carlo algorithm for the simulation of adsorption in porous materials. We focus on Nvidia's GPUs and CUDA's Fermi architecture specifically. The resulting package supports the different ensemble methods for the Monte Carlo …

    wayne-thes Repository record for Advanced Optimization Techniques For Monte Carlo Simulation On Graphics Processing Units (opens in a new tab)

  15. Advancing Efficiency of Unstructured Mesh Processing With Localized Data Structures

    Unstructured meshes are widely used to represent complex shapes and data in visualization tasks, such as medical imaging, engineering design, and geometric modeling. However, their unevenly distributed elements make them memory-intensive and time-consuming to process, especially as mesh sizes grow. …

    clemson Repository record for Advancing Efficiency of Unstructured Mesh Processing With Localized Data Structures (opens in a new tab)