Abstract Coarse grain architectures need domain specific place and route methods. The existence of such methods provided, algorithms can be executed in time and space on the processing elements of coarse grain reconfigurable systems. Additionally, the short reconfiguration time and reduced power requirements comparing to FPGA makes coarse grain systems worth to be scrutinized as alternative execution platforms. By help of spectral methods, which target quadratic distance optimization of graphs, we can achieve short communication distances. This paper shows how to use the spectral method for efficiently scheduling processing elements of coarse grain reconfigurable devices by combining the spectral method and ASAP scheduling.
TEMPORAL GRAPH PLACEMENT ON MESH-BASED COARSE GRAIN RECONFIGURABLE SYSTEMS USING THE SPECTRAL METHOD
2005-01-01
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
An efficient coarse mesh rebalancing method for nodal codes
TIBKAT | 1977
|Machinability of Elongated Coarse Grain Fe-Based Superalloys
British Library Online Contents | 2014
|Machinability of Elongated Coarse Grain Fe-Based Superalloys
British Library Online Contents | 2014
|Reconfigurable Temporal Fourier Transformation and Temporal Imaging
British Library Online Contents | 2014
|Reconfigurable Temporal Fourier Transformation and Temporal Imaging
British Library Online Contents | 2014
|