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 27 for “"DATA-PARALLEL APPLICATIONS"”.

  1. Accelerating Data Parallel Applications via Hardware and Software Techniques

    <p>The unprecedented amount of data available today opens the door to many new applications in areas such as finance, scientific simulation, machine learning, etc. Many such applications perform the same computations on different data, which are called data-parallel. However, processing this …

    duke Repository record for Accelerating Data Parallel Applications via Hardware and Software Techniques (opens in a new tab)

  2. Design and resource management of reconfigurable multiprocessors for data-parallel applications

    … a wide range of computation-intensive applications. Most often they are Application Specific Programmable Circuiits (ASPCs), which are developer programmable instead of user programmable. The major disadvantages of ASPCs are minimal programmability, and significant time and energy …

    njit Repository record for Design and resource management of reconfigurable multiprocessors for data-parallel applications (opens in a new tab)

  3. Verifying a Systematic Application to Accelerator Roadmap using Shallow Water Wave Equations

    With the advent of parallel computing, a number of hardware architectures have become available for data parallel applications. Every architecture is unique with respect to characteristics such as floating point operations per second, memory bandwidth and synchronization costs. Data parallel …

    clemson Repository record for Verifying a Systematic Application to Accelerator Roadmap using Shallow Water Wave Equations (opens in a new tab)

  4. Accelerator compiler for the VENICE vector processor

    … for the Microsoft Accelerator, a high-level data parallel library in C/C++ and C\#. This allows automatic compilation from high-level programs into VENICE assembly code, thus avoiding the process of writing assembly code used by previous SVPs. Experimental results show the compiler can …

    ubc Repository record for Accelerator compiler for the VENICE vector processor (opens in a new tab) Download PDF for Accelerator compiler for the VENICE vector processor (opens in a new tab)

  5. Implementation and Evaluation of Deep Neural Networks in Commercially Available Processing in Memory Hardware

    … are often associated with a large number of data-parallel computations. Therefore, data-centric computing paradigms, such as Processing in Memory (PIM), are being widely explored for CNN acceleration applications. A recent PIM architecture, developed and commercialized by the UPMEM company, …

    rit Repository record for Implementation and Evaluation of Deep Neural Networks in Commercially Available Processing in Memory Hardware (opens in a new tab)

  6. Efficient memory-level parallelism extraction with decoupled strands

    … that exploits intra-thread memory-level parallelism (MLP) to improve performance efficiency on highly threaded workloads. Outrider enables a single thread of execution to be presented to the architecture as multiple decoupled instruction streams, consisting of either memory accessing or …

    uiuc Repository record for Efficient memory-level parallelism extraction with decoupled strands (opens in a new tab)

  7. Improving Energy-Efficiency through Smart Data Placement in Hadoop Clusters

    … source framework, has revolutionized the big data world because of its ability to process vast amounts of unstructured and semi-structured data. This ability makes Hadoop the ‘go-to’ technology for many industries that generate big data, thus it also aids in being cost effective, unlike other …

    columbus-state Repository record for Improving Energy-Efficiency through Smart Data Placement in Hadoop Clusters (opens in a new tab)

  8. GSI: a GPU stall inspector to characterize the sources of memory stalls for tightly coupled GPUs

    … rise of dark silicon and motivated a move toward parallelism and specialization. As a result, energy-efficient high-throughput GPU cores are increasingly favored for accelerating data-parallel applications. However, the best way to efficiently communicate and synchronize across heterogeneous cores …

    uiuc Repository record for GSI: a GPU stall inspector to characterize the sources of memory stalls for tightly coupled GPUs (opens in a new tab)

  9. Multi-GPU Load Balancing for Simulation and Rendering

    … performance by taking advantage of massive parallelism of GPUs for data parallel applications. Computation in visualization applications is suitable for parallelization on the GPU, which can improve performance and interactivity in these applications. If used effectively, multiple GPUs can …

    vt Repository record for Multi-GPU Load Balancing for Simulation and Rendering (opens in a new tab)

  10. Dynamic Memory Bandwidth Allocation for Real-Time GPU-Based SoC Platforms

    … systems to cope with the computational demand of data parallel applications. However, contention for access to shared main memory can lead to significant performance degradation on both CPU and GPU. Existing work has shown that memory bandwidth throttling is effective in protecting real-time …

    waterloo Repository record for Dynamic Memory Bandwidth Allocation for Real-Time GPU-Based SoC Platforms (opens in a new tab)

  11. Dynamic re-optimization techniques for stream processing engines and object stores

    Large scale data storage and processing systems are strongly motivated by the need to store and analyze massive datasets. The complexity of a large class of these systems is rooted in their distributed nature, extreme scale, need for real-time response, and streaming nature. The use of these …

    purdue-thes Repository record for Dynamic re-optimization techniques for stream processing engines and object stores (opens in a new tab)

  12. Architectural support for inter-thread synchronization in SIMT architectures

    … have seen widespread interest in accelerating data parallel applications. In the SIMT model, small groups of scalar threads operate in lockstep. Within each group, current SIMT implementations serialize the execution of threads that follow different paths, and to ensure efficiency, revert to …

    ubc Repository record for Architectural support for inter-thread synchronization in SIMT architectures (opens in a new tab) Download PDF for Architectural support for inter-thread synchronization in SIMT architectures (opens in a new tab)

  13. Compiler support for machine-independent parallelization of irregular problems

    Data-parallel languages, such as H scIGH P scERFORMANCE F scORTRAN or F scORTRAN D, provide a machine-independent data-parallel programming paradigm in which the applications programmer uses a dialect of a sequential language annotated with high-level data-distribution directives. Identifying …

    rice Repository record for Compiler support for machine-independent parallelization of irregular problems (opens in a new tab)

  14. Runtime specialization for heterogeneous CPU-GPU platforms

    Heterogeneous parallel architectures like those comprised of CPUs and GPUs are a tantalizing compute fabric for performance-hungry developers. While these platforms enable order-of-magnitude performance increases for many data-parallel application domains, there remain several open challenges: (i) …

    gatech Repository record for Runtime specialization for heterogeneous CPU-GPU platforms (opens in a new tab)

  15. Automatic methods for distribution of data-parallel programs on multi-device heterogeneous platforms

    … methods for programming and distributing data-parallel applications for heterogeneous multiprocessor systems. These systems are ubiquitous today. They range from embedded devices with low power consumption to high performance distributed systems. The demand for these systems is growing …

    qucosa-diss

  16. Near-data scheduling for data centers with multiple levels of data locality

    Data locality is a fundamental issue for data-parallel applications. Considering MapReduce in Hadoop, the map task scheduling part requires an efficient algorithm which takes data locality into consideration; otherwise, the system may become unstable under loads inside the system's capacity region …

    uiuc Repository record for Near-data scheduling for data centers with multiple levels of data locality (opens in a new tab)

  17. An MPI-based 2D data redistribution library for dense arrays

    In HPC, data redistributions (reorganizations) are used in parallel applications to improve performance and/or provide data-locality compatibility with sequences of parallel operations. Data reorganization refers to changing the logical and physical arrangement of data (such as dense arrays or …

    utc Repository record for An MPI-based 2D data redistribution library for dense arrays (opens in a new tab)

  18. Power and Performance Optimization in GPGPU

    Thread parallel hardware, as the Graphics Processing Units (GPUs), greatly outperform CPUs in providing high compute throughput and memory bandwidth which make them ideal for accelerating various data-parallel applications. These hardware designs provide high performance computing by supporting a …

    tamu Repository record for Power and Performance Optimization in GPGPU (opens in a new tab)

  19. Vertical Integration in Open-Source Hardware-Software Co-Design for Accelerator Architecture Research

    The emergence of data-parallel architectures and General-Purpose Graphics Processing Units (GPGPUs) has opened new opportunities to address the power limitations and scalability of multi-core processors, paving the way for novel methods to exploit the abundant data parallelism present in emerging …

    gatech Repository record for Vertical Integration in Open-Source Hardware-Software Co-Design for Accelerator Architecture Research (opens in a new tab)

Page 1 of 2