EPIMap: Using Epimorphism to map applications on CGRAs

@article{Hamzeh2012EPIMapUE,
  title={EPIMap: Using Epimorphism to map applications on CGRAs},
  author={M. Hamzeh and Aviral Shrivastava and S. Vrudhula},
  journal={DAC Design Automation Conference 2012},
  year={2012},
  pages={1280-1287}
}
Coarse-Grained Reconfigurable Architectures (CGRAs) are an attractive platform that promise simultaneous high-performance and high power-efficiency. One of the primary challenges in using CGRAs is to develop efficient compilers that can automatically and efficiently map applications to the CGRA. To this end, this paper makes several contributions: i) Using Re-computation for Resource Limitations: For the first time in CGRA compilers, we propose the use of re-computation as a solution for… Expand
REGIMap: Register-aware application mapping on Coarse-Grained Reconfigurable Architectures (CGRAs)
TLDR
This paper significantly improves the state-of-the-art in CGRA compilers by first creating a precise and general formulation of the problem of loop mapping on CGRAs, considering the local registers, and from the insights gained, distilling an efficient and constructive heuristic solution. Expand
A Scalable Design Approach to Efficiently Map Applications on CGRAs
TLDR
This paper presents a new scalable efficient design flow to map applications written in high level language on CGRAs that leverages on simultaneous scheduling and binding steps respectively based on a heuristic and an exact method stochastically degenerated. Expand
Optimizing Spatial Mapping of Nested Loop for
TLDR
This paper tackles the problem of mapping loops onto CGRAs efficiently by establishing a performance optimization problem, including loop transformation and back- end placing and routing, and built a complete flow of mapping loop nests onto CGRA. Expand
Resource-saving compile flow for coarse-grained reconfigurable architectures
TLDR
This paper chooses to use a new CGRA with global synchronization mechanism, which help reducing the nodes and edges in modified DFG, and proposes a complete and systematic DFG modification flow which saves more resources. Expand
Graph minor approach for application mapping on CGRAs
  • L. Chen, T. Mitra
  • Computer Science
  • 2012 International Conference on Field-Programmable Technology
  • 2012
TLDR
This work transforms the CGRA mapping problem with route sharing into a graph minor problem and provides an efficient framework based on graph mapping to solve this problem and shows higher performance compared to state-of-the-art solutions with better resource utilization and minimal compilation time. Expand
Optimizing Spatial Mapping of Nested Loop for Coarse-Grained Reconfigurable Architectures
TLDR
This paper tackles the problem of mapping loops onto CGRAs efficiently by establishing a performance optimization problem, including loop transformation and back- end placing and routing, and built a complete flow of mapping loop nests onto CGRA. Expand
RAMP: Resource-Aware Mapping for CGRAs
TLDR
Evaluating top performance-critical loops of MiBench benchmarks over 12 architectural configurations, it is found that RAMP is able to accelerate loops by 23× over sequential execution, achieving a geomean speedup of 2.13× over state-of-the-art. Expand
Towards Higher Performance and Robust Compilation for CGRA Modulo Scheduling
TLDR
This article decomposes the CGRA MS problem into the temporal and spatial mapping problem and reorganizes the processes inside these two problems to provide a comprehensive and systematic mapping flow that includes a powerful buffer allocation algorithm, and efficient interconnection & computational constraints solving algorithms. Expand
CGRA MODULO SCHEDULING FOR ACHIEVING BETTER PERFORMANCE AND INCREASED EFFICIENCY
Coarse-Grained Reconfigurable Architectures (CGRA) is an effective solution for speeding up computer-intensive activities due to its high energy efficiency and flexibility sacrifices. The timelyExpand
Optimizing stream program performance on CGRA-based systems?
TLDR
The evaluation results demonstrate that the software and hardware optimizations can help generate highly efficient mapping of stream applications to CGRAs, enabling far more energy-efficient executions compared to using state-of-the-art GP-GPUs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
A Graph Drawing Based Spatial Mapping Algorithm for Coarse-Grained Reconfigurable Architectures
TLDR
A graph drawing based approach, split-push kernel mapping (SPKM), for mapping applications onto CGRAs, which can map on average 4.5times more applications than the previous approach, while generating mappings which have better qualities in terms of utilized CGRA resources. Expand
Edge-centric modulo scheduling for coarse-grained reconfigurable architectures
TLDR
Experiments on a wide variety of compute-intensive loops from the multimedia domain show that EMS improves throughput by 25% over traditional iterative modulo scheduling, and achieves 98% of the throughput of simulated annealing techniques at a fraction of the compilation time. Expand
SPR: an architecture-adaptive CGRA mapping tool
In this paper we present SPR, a new architecture-adaptive mapping tool for use with Coarse-Grained Reconfigurable Architectures (CGRAs). It combines a VLIW style scheduler and FPGA style placementExpand
Embedded tutorial — Compilation techniques for CGRAs: Exploring all parallelization approaches
TLDR
Insight is given in CGRA architectures and their compilation techniques to exploit parallelism and polymorphic pipeline arrays, expanding coarse-grained arrays beyond innermost loops are covered. Expand
Architecture Enhancements for the ADRES Coarse-Grained Reconfigurable Array
TLDR
This paper investigates the influence of register file partitions, register file sizes and the interconnection topology of ADRES, and proposes an enhanced architecture instantiation that improves performance by 60 - 70% and reduces energy by 50%. Expand
A Modulo Scheduling Algorithm for a Coarse-Grain Reconfigurable Array Template
TLDR
An efficient modulo scheduling algorithm for a CGRA template with separation of resource reservation and scheduling, use of a compact three-dimensional architecture graph and a resource usage aware relocation algorithm is presented. Expand
Exploring the design space of an optimized compiler approach for mesh-like coarse-grained reconfigurable architectures
TLDR
The experimental results showed that the operation parallelism was significantly improved by the mapping approach and the relation that exists between the performance improvements and the memory access latency, the interconnection network and the processing elements' register file size. Expand
MATRIX: a reconfigurable computing architecture with configurable instruction distribution and deployable resources
  • E. Mirsky, A. DeHon
  • Computer Science
  • 1996 Proceedings IEEE Symposium on FPGAs for Custom Computing Machines
  • 1996
TLDR
MATRIX is a novel, coarse-grain, reconfigurable computing architecture which supports configurable instruction distribution that can serve as an instruction store, a memory element, or a computational element, and the adaptability is made possible by a multi-level configuration scheme. Expand
PipeRench: a co/processor for streaming multimedia acceleration
TLDR
A novel reconfigurable fabric architecture, PipeRench, optimized to accelerate these types of computations, which enables fast, robust compilers, supports forward compatibility, and virtualizes configurations, thus removing the fixed size constraint present in other fabrics. Expand
A spatial mapping algorithm for heterogeneous coarse-grained reconfigurable architectures
In this work, we investigate the problem of automatically mapping applications onto a coarse-grained reconfigurable architecture and propose an efficient algorithm to solve the problem. We formalizeExpand
...
1
2
3
...