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 19 of 19 for “"Parallel programming model"”.

  1. An Analysis of an Interrupt-Driven Implementation of the Master-Worker Model with Application-Specific Coprocessors

    In this thesis, we present a versatile parallel programming model composed of an individual general-purpose processor aided by several application-specific coprocessors. These computing units operate under a simplification of the master-worker model. The user-defined coprocessors may be either …

    vt Repository record for An Analysis of an Interrupt-Driven Implementation of the Master-Worker Model with Application-Specific Coprocessors (opens in a new tab)

  2. Efficient parallelization of Bowtie 2 with OpenCL on GPU

    … high speed and accuracy. This thesis presents a parallel implementation of Bowtie 2 with OpenCL, which is a parallel programming model that is becoming widely known and receiving great interest from researchers in recent years. This OpenCL implementation has high portability on various devices, …

    uiuc Repository record for Efficient parallelization of Bowtie 2 with OpenCL on GPU (opens in a new tab)

  3. Abstracting the hardware/software boundary through a standard system support layer and architecture

    … as separate and inconsistent computational models. Alternatively, the work presented in this thesis proposes using parallel programming models to abstract the CPU/FPGA boundary. Computational tasks would exist either as traditional CPU bound threads or as custom hardware threads running …

    ku Repository record for Abstracting the hardware/software boundary through a standard system support layer and architecture (opens in a new tab)

  4. Real-Time Smoothed Particle Hydrodynamics For CUDA

    … GPU as an at- tractive platform for inherently parallel programming problems. NVIDIA's Compute Unifed Device Architecture (CUDA) has enabled developers to harness the massive computational power of the GPU through the CUDA parallel programming model. Smoothed particle hydrodynamics (SPH) …

    montana-tech Repository record for Real-Time Smoothed Particle Hydrodynamics For CUDA (opens in a new tab)

  5. Real-Time Smoothed Particle Hydrodynamics For CUDA

    … GPU as an at- tractive platform for inherently parallel programming problems. NVIDIA's Compute Unifed Device Architecture (CUDA) has enabled developers to harness the massive computational power of the GPU through the CUDA parallel programming model. Smoothed particle hydrodynamics (SPH) …

    montana Repository record for Real-Time Smoothed Particle Hydrodynamics For CUDA (opens in a new tab)

  6. Boosting static timing analysis with programming and algorithmic approaches

    … bottlenecks in digital design. We study a novel parallel programming model and algorithm to boost timing analysis. As multi-core systems have become common in modern electronics, how to fit timing analysis into the multithreading environment is a trending research topic. We explore this direction …

    uiuc Repository record for Boosting static timing analysis with programming and algorithmic approaches (opens in a new tab)

  7. Scalable asynchronous connected components detection based on a parallel union-find algorithm

    … in a graph is a well-studied problem. Various parallel algorithms to detect and label connected components exist, many of which are optimized for a shared-memory environment. However, scientific and engineering applications today process large-scale graphs that do not fit in a single compute …

    uiuc Repository record for Scalable asynchronous connected components detection based on a parallel union-find algorithm (opens in a new tab)

  8. Studying and Analysing Transactional Memory Using Interval Temporal Logic and AnaTempura

    … technique which offers a high-level abstract parallel programming model for future chip multiprocessor (CMP) systems. Moreover, it adapts the well-established popular paradigm of transactions and thus provides a general and flexible way to allow programs to read and modify disparate memory …

    de-montfort Repository record for Studying and Analysing Transactional Memory Using Interval Temporal Logic and AnaTempura (opens in a new tab)

  9. ADAM : a decentralized parallel computer architecture featuring fast thread and data migration and a uniform hardware abstraction

    … a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are …

    mit Repository record for ADAM : a decentralized parallel computer architecture featuring fast thread and data migration and a uniform hardware abstraction (opens in a new tab)

  10. OpenMP-CUDA implementation of the moment method and multilevel fast multipole algorithm on multi-GPU computing systems

    … GPU computation based on the hybrid OpenMP-CUDA parallel programming model. The resultant algorithms are called the OpenMP-CUDA-MoM and the OpenMP-CUDA-MLFMA, respectively. Both of the proposed methods are applied to compute electromagnetic scattering by a three-dimensional conducting object. For …

    uiuc Repository record for OpenMP-CUDA implementation of the moment method and multilevel fast multipole algorithm on multi-GPU computing systems (opens in a new tab)

  11. High performance sparse Fast Fourier Transform using OpenACC

    … signals of sparse nature. The algorithm has been parallelized using multiple approaches, such as over multicore by Cheng et al. over GPGPUs using CUDA by Cheng et al. and optimized for serial execution using SSE intrinsics by Schumacher et al. ☐ While the increase in number of cores and memory …

    udel Repository record for High performance sparse Fast Fourier Transform using OpenACC (opens in a new tab)

  12. Improving programmability and performance for scientific applications

    … both the problems and solutions increases, the programming methodologies must remain at a level that can be understood by programmers and scientists alike. In our work, this problem is encountered when developing an optimized framework to best exploit the semantic properties of a finite-element …

    purdue-thes Repository record for Improving programmability and performance for scientific applications (opens in a new tab)

  13. Chromatic scheduling of dynamic data-graph computations

    Data-graph computations are a parallel-programming model popularized by programming systems such as Pregel, GraphLab, PowerGraph, and GraphChi. A fundamental issue in parallelizing data-graph computations is the avoidance of races between computation occurring on overlapping regions of the graph. …

    mit Repository record for Chromatic scheduling of dynamic data-graph computations (opens in a new tab)

  14. Prefetching for complex memory access patterns

    … of workloads. I do this by developing a highly parallel programming model that can be used to issue prefetches, thus allowing high-throughput prefetching with low power and area overheads of only around 3%, and a 3x geometric mean speedup for a variety of memory-bound applications. To facilitate …

    cambridge Repository record for Prefetching for complex memory access patterns (opens in a new tab)

  15. Load Balancing Scientific Applications

    … evenly is challenging because many large modern parallel codes simulate behavior of physical systems that evolve over time, and their workloads change over time. Furthermore, the cost of imbalanced load increases with scale because most large-scale scientific simulations today use a Single …

    tdl Repository record for Load Balancing Scientific Applications (opens in a new tab)

  16. Hierarchically Tiled Arrays as high-level programming abstractions for dataflow runtime systems

    … of attempting to build distributed, immensely parallel and highly heterogeneous machines. It is well known that in order to utilize these machines, good parallel programs are essential. However, conventional parallel programming models were created when supercomputers were smaller and more …

    uiuc Repository record for Hierarchically Tiled Arrays as high-level programming abstractions for dataflow runtime systems (opens in a new tab)

  17. Hybrid Parallel Computing Strategies for Scientific Computing Applications

    … with respect to the efficient exploitation of parallelism for large-scale, scientific computing simulations. For example, a simulation of the human tonsil at the cellular level involves the computation of the motion and interaction of millions of cells over extended periods of time. Also, the …

    vt Repository record for Hybrid Parallel Computing Strategies for Scientific Computing Applications (opens in a new tab)

  18. Runtime support for irregular computation in MPI-based applications

    … that have been using irregular computation models in various domains, such as computational chemistry, bioinformatics, nuclear reactor simulation and social network analysis. Due to the irregular and data-dependent communication patterns and sparse data structures involved in those …

    uiuc Repository record for Runtime support for irregular computation in MPI-based applications (opens in a new tab)

  19. Multi-solver schemes for electromagnetic modeling of large and complex objects

    … of numerical algorithms for electromagnetic modeling of large and complex objects. First, a GPU-accelerated multilevel fast multipole algorithm (MLFMA) is presented to improve the efficiency of the traditional MLFMA by taking advantage of GPU hardware advancement. The proposed hierarchical …

    uiuc Repository record for Multi-solver schemes for electromagnetic modeling of large and complex objects (opens in a new tab)