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 45 for “"Irregular Applications"”.
-
Accelerating irregular applications on parallel hybrid platforms
… efficient way to simplify the task of developing applications on such hybrid platforms. This dissertation explores solutions to the abovementioned challenges in the context of an important class of applications, namely irregular applications. Compared to regular applications, irregular …
-
Run-time optimization of adaptive irregular applications
… when parallelizing and optimizing adaptive irregular applications, because it performs program analysis and adaptive optimizations during program execution. Run-time techniques can succeed where static techniques fail because they exploit the characteristics of input data, programs' dynamic …
-
Efficient Parallelization Of Irregular Applications On Gpu Architectures
… (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with a computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following …
-
Transforming and Optimizing Irregular Applications for Parallel Architectures
… dramatically increase. On the other hand, many applications in well-established and emerging fields, such as bioinformatics, social network analysis, and graph processing, exhibit increasing irregularities in memory access, control flow, and communication patterns. While multiple techniques have …
-
Large-scale transactional execution of FPGA-accelerated irregular applications
Irregular workloads are programs organized around pointer-based data structures such as graphs. They are widely used in many fields such as computer/human network analysis, machine learning, data mining, graphics, electronic design automation, and so on. Many irregular applications have massive …
-
Accelerating Tree-Based Irregular Applications by Exploiting SIMD Parallelism
… most pervasive data structures. Many tree-based applications feature abundant amount of data level parallelism (DLP), and modern SIMD architectures, such as GPUs and the SIMD instruction extension to CPUs, appear well-suited. However, due to the high irregularity in control flow and data accesses …
-
Compiler and Runtime Optimization of Computational Kernels for Irregular Applications
… difficult. Another challenge with sophisticated applications is that data structures, communication, and control patterns are often irregular and unknown before the program execution. Lack of regularity makes static analysis especially difficult or very often impossible. To overcome these issues, …
-
Accelerating irregular applications via efficient synchronization and data access techniques
Irregular applications comprise an increasingly important workload domain for many fields, including bioinformatics, chemistry, graph analytics, physics, social sciences and machine learning. Therefore, achieving high performance and energy efficiency in the execution of emerging irregular …
-
Runtime support for load balancing of parallel adaptive and irregular applications
Applications critical to today's engineering research often must make use of the increased memory and processing power of a parallel machine. While advances in architecture design are leading to more and more powerful parallel systems, the software tools needed to realize their full potential are …
-
Acceleration and optimization of dynamic parallelism for irregular applications on GPUs
… dynamic parallelism occurring in the irregular data intensive applications. These dynamically formed pockets of structured parallelism can utilize the recently introduced device-side nested kernel launch capabilities on GPUs. However, the low utilization of GPU resources and the high …
-
Runtime Approaches to Improve the Efficiency of Hybrid and Irregular Applications
… can be used to speed up regular paral- lel applications relatively easily because straightforward approaches usually suffice to map their computation patterns and data layouts on to available on-node parallelism. However, irregular parallel applications require considerable effort to run on …
-
Efficiently and Transparently Maintaining High SIMD Occupancy in the Presence of Wavefront Irregularity
… is increasing for high throughput processing of irregular streaming applications; examples of such applications from scientific and engineering domains include biological sequence alignment, network packet filtering, automated face detection, and big graph algorithms. With wide SIMD, lightweight …
-
Software prefetching for memory-level parallelism
… to tolerate long memory access latencies for irregular applications with little locality. As a result, high-performance general-purpose processors that support out-of-order instruction execution, when executing irregular applications, often suffer from severe underutilization of the underlying …
-
Runtime support for irregular computation in MPI-based applications
In recent years there are increasing number of 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 …
-
Exploiting Parallelism in GPUs
… while using less energy. Beyond these obvious applications for GPUs, a larger variety of applications can benefit from a GPU's large computation and memory bandwidth. However, many of these applications are irregular and, as a result, require synchronization and scheduling that are commonly …
-
Task Level Parallelization of Irregular Computations using OpenMP 3.0
… programming language used to develop parallel applications on shared memory machines. OpenMP is very suitable for designing parallel algorithms for regular applications where the amount of work is known apriori and therefore distribution of work among the threads can be done at compile time. In …
-
Intelligent scheduling for simultaneous CPU-GPU applications
… CPU and GPU from various aspects for regular applications which have high parallelism and little data dependent control flows. However, it is still not clear how irregular applications, which behave differently on different inputs, could be efficiently scheduled on such heterogeneous computing …
-
OpenMP on networks of workstations
… The integrated approach can effectively optimize irregular applications, for which an exact compile-time analysis is not possible. One optimization aggregates messages for irregular applications based on the data access information provided by the compiler. Another optimization improves the …
-
Automatically Optimizing Tree Traversal Algorithms
… to computational astrophysics, focus heavily on irregular applications. In contrast to regular applications, which operate over dense matrices and arrays, irregular programs manipulate and traverse complex data structures like trees and graphs. As irregular applications operate on ever larger …
-
Efficient Machine Learning Approach for Optimizing Scientific Computing Applications on Emerging HPC Architectures
Efficient parallel implementations of scientific applications on multi-core CPUs with accelerators such as GPUs and Xeon Phis is challenging. This requires - exploiting the data parallel architecture of the accelerator along with the vector pipelines of modern x86 CPU architectures, load balancing, …
Page 1 of 3