Mapping Algorithm for Coarse-Grained Reconfigurable Multimedia Architectures

2012 ◽  
Author(s):  
Naijin Chen ◽  
Jianhui Jiang
Keyword(s):  
Coarse Grained ◽  
Mapping Algorithm ◽  
Multimedia Architectures

scholarly journals Efficient scheduling mapping algorithm for row parallel coarse-grained reconfigurable architecture

2021 ◽  
Vol 26 (5) ◽  
pp. 724-735
Author(s):  
Naijin Chen ◽  
Zhen Wang ◽  
Ruixiang He ◽  
Jianhui Jiang ◽  
Fei Cheng ◽  
...  
Keyword(s):  
Reconfigurable Architecture ◽  
Coarse Grained ◽  
Mapping Algorithm

scholarly journals CGRA MODULO SCHEDULING FOR ACHIEVING BETTER PERFORMANCE AND INCREASED EFFICIENCY

2021 ◽  
Vol 12 (4) ◽  
pp. 1400-1413
Author(s):  
Siva Sankara Phani.T , Et. al.
Keyword(s):  
High Performance ◽  
High Energy ◽  
Coarse Grained ◽  
Modulo Scheduling ◽  
Stable Algorithm ◽  
Mapping Algorithms ◽  
Mapping Algorithm ◽  
Rearrangement Mechanism ◽  
Planning Algorithm ◽  
Better Than

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 timely implementation of CGRA loops was one of the hardest problems in the analysis. Modulo scheduling (MS) was productive in order to implement loops on CGRAs. The problem remains with current MS algorithms, namely to map large and irregular circuits to CGRAs over a fair period of compilation with restricted computational and high-performance routing tools. This is mainly due to an absence of awareness of major mapping limits and a time consuming approach to solving temporary and space-related mapping using CGRA buffer tools. It aims to boost the performance and robust compilation of the CGRA modulo planning algorithm. The problem with the CGRA MS is divided into time and space and the mechanisms between the two problems have to be reorganized. We have a detailed, systematic mapping fluid that addresses the algorithms of the time mapping problem with a powerful buffer algorithm and efficient connection and calculation limitations. We create a fast-stable algorithm for spatial mapping with a retransmission and rearrangement mechanism. With higher performance and quicker build-up time, our MS algorithm can map loops to CBGRA. The results show that, given the same compilation budget, our mapping algorithm results in a better rate for compilation. The performance of this method will be increased from 5% to 14%, better than the standard CGRA mapping algorithms available.

Coarse Grained-to-Atomistic Mapping Algorithm: A Tool for Multiscale Simulations

2008 ◽  
pp. 73-88 ◽  
Author(s):  
Steven O. Nielsen ◽  
Bernd Ensing ◽  
Preston B. Moore ◽  
Michael L. Klein
Keyword(s):  
Coarse Grained ◽  
Multiscale Simulations ◽  
Mapping Algorithm

scholarly journals Configurational-Bias Monte Carlo Back-Mapping Algorithm for Efficient and Rapid Conversion of Coarse-Grained Water Structures into Atomistic Models

2018 ◽  
Vol 122 (28) ◽  
pp. 7102-7110 ◽  
Author(s):  
Troy D. Loeffler ◽  
Henry Chan ◽  
Badri Narayanan ◽  
Mathew J. Cherukara ◽  
Stephen Gray ◽  
...  
Keyword(s):  
Monte Carlo ◽  
Coarse Grained ◽  
Mapping Algorithm ◽  
Atomistic Models ◽  
Rapid Conversion
Sign in / Sign up

Export Citation Format

Share Document