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 13 of 13 for “"Irregular Applications"”.
-
Accelerating Irregular Applications with Pipeline Parallelism
Irregular applications have frequent data-dependent memory accesses and control flow. They arise in many emerging and important domains, including sparse deep learning, graph analytics, and database processing. Conventional architectures cannot handle irregular applications efficiently because …
-
parallel communication mechanisms for sparse, irregular applications
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
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 …
-
Architectural Support for Effective Data Compression In Irregular Applications
Irregular applications, such as graph analytics and sparse linear algebra, exhibit frequent indirect, data-dependent accesses to single or short sequences of elements that cause high main memory traffic and limit performance. Data compression is a promising way to accelerate irregular applications …
-
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, …
-
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 …
-
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 …
-
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
… 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 …
-
Run-Time Techniques for Dynamic Multithreaded Computations
… Cray T3D and the SGI Origin 2000, for four large irregular applications demonstrates their individual effectiveness and collective sufficiency: Each application achieves performance comparable to the best achievable using low-level means. Additionally, these improvements persist across a range of …
-
Optimizing Barnes-Hut simulations for many-core super computers using the scalable parallel runtime
… one-sided com- munication facilities, ideal for irregular applications with dynamic commu- nication patterns like that of Barnes-Hut.
-
Architecting, programming, and evaluating an on-chip incoherent multi-processor memory hierarchy
… show that, with our approach, the execution of applications on incoherent cache hierarchies can deliver reasonable performance. For execution within a cluster, the average execution time of our applications is only 2% higher than with hardware cache coherence. For execution across multiple …
-
Synchronization-avoiding graph algorithms and runtime aspects
… easier to design and implement. However, irregular applications such as graph algorithms can suffer performance bottlenecks due to the straggler effect induced by global and vertex-centric barriers. In the effort to eliminate barriers, we design and study unordered, data-driven graph …