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.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Dittmann, F., Bobda, C. (2005). TEMPORAL GRAPH PLACEMENT ON MESH-BASED COARSE GRAIN RECONFIGURABLE SYSTEMS USING THE SPECTRAL METHOD. In: Rettberg, A., Zanella, M.C., Rammig, F.J. (eds) From Specification to Embedded Systems Application. IFIP On-Line Library in Computer Science, vol 184. Springer, Boston, MA. https://doi.org/10.1007/11523277_29
Download citation
DOI: https://doi.org/10.1007/11523277_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-27557-4
Online ISBN: 978-0-387-27559-8
eBook Packages: Computer ScienceComputer Science (R0)