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.


    Access

    Download


    Export, share and cite



    Title :

    TEMPORAL GRAPH PLACEMENT ON MESH-BASED COARSE GRAIN RECONFIGURABLE SYSTEMS USING THE SPECTRAL METHOD


    Contributors:


    Publication date :

    2005-01-01


    Size :

    10 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    Machinability of Elongated Coarse Grain Fe-Based Superalloys

    Özçatalbaş, Yusuf | British Library Online Contents | 2014


    Machinability of Elongated Coarse Grain Fe-Based Superalloys

    Ozcatalbas, Y. | British Library Online Contents | 2014


    Sensor placement method based on bond graph models

    Ling, Mu / Yuan, Haiwen | British Library Online Contents | 2016


    1124 A Hybrid Fine-Coarse Computational Mesh Simulation Tool for Space Nuclear Systems

    Charmeau, A. / Anghaie, S. / American Nuclear Society | British Library Conference Proceedings | 2005