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 20 of 33 for “"parallel code"”.

  1. Parallel code-specific CPU simulation with dynamic phase convergence modeling for HW/SW co-design

    … While this data can be obtained through source code profiling of an application running on the target processor, accomplishing such when the target CPU hardware is not actively available typically requires time-consuming CPU simulation, which is often too slow to practically consider for large …

    uiuc Repository record for Parallel code-specific CPU simulation with dynamic phase convergence modeling for HW/SW co-design (opens in a new tab)

  2. Image alignment and dynamic graph analytics : two case studies of how managing data movement can make (parallel) code run fast

    High performance applications are becoming increasingly resource hungry. We want to solve more complex problems and use more data to get higher quality results. However, the more data we store, the slower it is to access any piece. This effect is seen directly in the memory hierarchy. We can access …

    mit Repository record for Image alignment and dynamic graph analytics : two case studies of how managing data movement can make (parallel) code run fast (opens in a new tab)

  3. AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM

    … of programs is taking place. Previous use of parallel code in programs was limited to servers that contained multiple CPUs on separate chips. This idea is starting to change, with the majority of chips sold today containing multiple CPUs which require parallel code in software programs. The …

    montana-tech Repository record for AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM (opens in a new tab)

  4. AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM

    … of programs is taking place. Previous use of parallel code in programs was limited to servers that contained multiple CPUs on separate chips. This idea is starting to change, with the majority of chips sold today containing multiple CPUs which require parallel code in software programs. The …

    montana Repository record for AN EQUIVALENT CLASS SOLUTION FOR A COMPLETE TEST OF A PARALLEL PROGRAM (opens in a new tab)

  5. Development of a Parallel Electrostatic PIC Code for Modeling Electric Propulsion

    This thesis presents the parallel version of Coliseum, the Air Force Research Laboratory plasma simulation framework. The parallel code was designed to run large simulations on the world fastest supercomputers as well as home mode clusters. Plasma simulations are extremely computationally intensive …

    vt Repository record for Development of a Parallel Electrostatic PIC Code for Modeling Electric Propulsion (opens in a new tab)

  6. Portable and productive high-performance computing

    … the following questions: Can programmers write code once, and execute it at optimal speed on any machine configuration? Can programmers write parallel code to simple models that hide the complex details of parallel programming? This thesis addresses these questions for certain "classes" of …

    mit Repository record for Portable and productive high-performance computing (opens in a new tab)

  7. Mapping numerical software onto distributed memory parallel systems

    The aim of this thesis is to further the use of parallel computers, in particular distributed memory systems, by proving strategies for parallelisation and developing the core component of tools to aid scalar software porting. The ported code must not only efficiently exploit available parallel

    greenwich Repository record for Mapping numerical software onto distributed memory parallel systems (opens in a new tab)

  8. Compiling reductions in data parallel programs for distributed memory multiprocessors

    … and optimization are crucial techniques in parallelizing compilers. They are used to detect the recurrences in a program and transform the originally sequential code into parallel code. Because of the expensive interprocessor communication cost, reduction recognition and efficient code

    rice Repository record for Compiling reductions in data parallel programs for distributed memory multiprocessors (opens in a new tab)

  9. Real-time adaptive-optics optical coherence tomography (AOOCT) image reconstruction on a GPU

    … the basics of how to use NVIDIA's CUDA to write parallel code, and a new AOOCT image reconstruction technology implemented using NVIDIA's CUDA. The results of this work demonstrate that image reconstruction can be done in real-time with high accuracy using a GPU.

    iupui Repository record for Real-time adaptive-optics optical coherence tomography (AOOCT) image reconstruction on a GPU (opens in a new tab)

  10. ESTIMATION ON GIBBS ENTROPY FOR AN ENSEMBLE

    … revolutions in the computer science field is parallel computing. A single parallel execution is not sufficient to see its non-deterministic features, as same execution with the same data at different time would end up with a different path. In order to see how non deterministic a parallel

    csusb Repository record for ESTIMATION ON GIBBS ENTROPY FOR AN ENSEMBLE (opens in a new tab)

  11. Parallel Processing for Modeling Reactive Transport in Groundwater

    … higher memory and computational requirements. Parallel processing provides the computational resources needed to employ reactive transport simulations effectively and more efficiently. N2D-H2 is a FORTRAN code that simulates two-dimensional reactive solute transport in groundwater. More …

    vt Repository record for Parallel Processing for Modeling Reactive Transport in Groundwater (opens in a new tab)

  12. Achieving performance portability across parallel accelerator architectures

    Parallel programming requires a significant amount of developer effort, and creating optimized parallel code is even more time-consuming. In the end, tuned parallel codes typically only perform well for a single architecture, or even microarchitecture. This thesis focuses on SPMD code written in …

    uiuc Repository record for Achieving performance portability across parallel accelerator architectures (opens in a new tab)

  13. Towards Algorithm Transformation for Temporal Data Mining on GPU

    … a cost. The GPU's architecture executes non-data parallel code with either marginal speedup or even slowdown. The type of data mining we examine, temporal data mining, uses a ¯nite state machine (FSM), which is non-data parallel. We contribute the concept of algorithm transformation for …

    vt Repository record for Towards Algorithm Transformation for Temporal Data Mining on GPU (opens in a new tab)

  14. Auto-tuning on the macro scale : high level algorithmic auto-tuning for scientific applications

    … the high-level: i) a multiplatform, auto-tuning parallel code generation framework for generalized stencil loops, ii) an auto-tunable algorithm for solving dense triangular systems, iii) an auto-tunable multigrid solver for sparse linear systems, and iv) tuned statistical regression techniques …

    mit Repository record for Auto-tuning on the macro scale : high level algorithmic auto-tuning for scientific applications (opens in a new tab)

  15. Boltzmann equation studies of the off-equilibrium QCD phenomena

    … the relativistic Boltzmann equation. We develop parallel code to solve the relativistic Boltzmann equation in the relaxation time approximation in 3 + 1 dimensions (without simplifying assumptions on possible symmetries of the dynamics). Our approach, solving for the distribution function, will …

    cape-town Repository record for Boltzmann equation studies of the off-equilibrium QCD phenomena (opens in a new tab)

  16. How do developers use parallel libraries?

    Parallel programming is hard. The industry leaders hope to convert the hard problem of using parallelism into the easier problem of using a parallel library. Yet, we know little about how programmers adopt these libraries in practice. Without such knowledge, other programmers cannot educate …

    uiuc Repository record for How do developers use parallel libraries? (opens in a new tab)

  17. Practical Time Travel of Multiprocessor Systems

    … platforms, there is a growing pressure to make parallel programming the norm. Unfortunately, most current programmers find parallel programming too complex. Therefore, we need tools, models, and architectures that make multiprocessors more programmable. One compelling way to improve …

    uiuc Repository record for Practical Time Travel of Multiprocessor Systems (opens in a new tab)

  18. Preconditioned sequential and parallel conjugate gradient algorithms for homotopy curve tracking

    … gradient method used in HOMPACK. In addition, a parallel version of Craig's method with incomplete LU factorization preconditioning is implemented on a shared memory parallel computer with various levels and degrees of parallelism (e.g., linear algebra, function and Jacobian matrix evaluation, …

    vt Repository record for Preconditioned sequential and parallel conjugate gradient algorithms for homotopy curve tracking (opens in a new tab)

  19. Type Oriented Parallel Programming

    Context: Parallel computing is an important field within the sciences. With the emergence of multi, and soon many, core CPUs this is moving more and more into the domain of general computing. HPC programmers want performance, but at the moment this comes at a cost; parallel languages are either …

    durham Repository record for Type Oriented Parallel Programming (opens in a new tab)

  20. Parallel Processing of Reactive Transport Models Using OpenMP

    Transport codes are beginning to be parallelized in order to allow more complex add-ons, such as geochemical packages, to utilize finer, more accurate grids, and to reduce solution times making stochastic and Monte Carlo simulations more feasible. Most codes parallelized via MPI (message passing …

    byu Repository record for Parallel Processing of Reactive Transport Models Using OpenMP (opens in a new tab)

Page 1 of 2