Mapping parallel graph algorithms to throughput-oriented architectures
نویسنده
چکیده
Table 1 Correlation of vertex and edge frontier sizes with execution time for three randomly selected roots of different graph structures. The size of the vertex frontier correlates positively with execution time regardless of the root or structure of the graph.. Figure 1 Evolution of vertex frontiers (as a percentage of total vertices) for differ-Figure 4 Power consumption for various betweenness centrality updates using two methods of parallelism.
منابع مشابه
Application Mapping onto Network-on-Chip using Bypass Channel
Increasing the number of cores integrated on a chip and the problems of system on chips caused to emerge networks on chips. NoCs have features such as scalability and high performance. NoCs architecture provides communication infrastructure and in this way, the blocks were produced that their communication with each other made NoC. Due to increasing number of cores, the placement of the cores i...
متن کاملFast Subgraph Matching on Large Graphs using Graphics Processors
Subgraph matching is the task of finding all matches of a query graph in a large data graph, which is known as an NP-complete problem. Many algorithms are proposed to solve this problem using CPUs. In recent years, Graphics Processing Units (GPUs) have been adopted to accelerate fundamental graph operations such as breadthfirst search and shortest path, owing to their parallelism and high data ...
متن کاملgProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کاملCompiling Rewriting onto SIMD and MIMD/SIMD Maschines
We present compilation techniques for Simple Maude, a declarative programming language based on Rewriting Logic which supports term, graph, and object-oriented rewriting. We show how to compile various constructs of Simple Maude onto SIMD and MIMD/SIMD massively parallel architectures, and in particular onto the Rewrite Rule Machine, a special purpose MIMD/SIMD architecture for rewriting. We sh...
متن کاملDeriving Dependence Graphs of Regular Algorithms and their Transformations – the Main Stage in ASIC and FPGA-based Architectures Design
The simple and feasible for CAD implementation method of deriving dependence graphs of regular algorithms and several examples of pupposive graph transformations are represented in this paper, which allow to derive the architectures of application specific parallel systems with desired features. Now this method is realized as a first part of the CAD-environment for designing of the application ...
متن کامل