• DocumentCode
    2908658
  • Title

    Constraint-Driven Instructions Selection and Application Scheduling in the DURASE system

  • Author

    Martin, Kevin ; Wolinski, Christophe ; Kuchcinski, Krzysztof ; Floch, Antoine ; Charot, François

  • Author_Institution
    Irisa, Univ. of Rennes I, Rennes, France
  • fYear
    2009
  • fDate
    7-9 July 2009
  • Firstpage
    145
  • Lastpage
    152
  • Abstract
    This paper presents a new constraint-driven method for computational pattern selection, mapping and application scheduling using reconfigurable processor extensions. The presented method is a part of DURASE system (Generic Environment for Design and Utilization of Reconfigurable Application-Specific Processors Extensions). The selected processor extensions are implemented as specialized processor instructions. They correspond to computational patterns identified as most frequently occurring or other interesting patterns in the application graph. Our methods can handle both time-constrained and resource-constrained scheduling. Experimental results obtained for the Media-Bench and Mi-Bench benchmarks show that the presented method ensures high speed-ups in application execution.
  • Keywords
    multiprocessing systems; reconfigurable architectures; DURASE system; MediaBench; MiBench; application graph; computational pattern selection; constraint-driven instructions selection; constraint-driven method; reconfigurable processor extensions; resource-constrained scheduling; time-constrained scheduling; Application software; Application specific processors; Computer applications; Computer architecture; Computer science; Data analysis; Hardware; Merging; Processor scheduling; Registers; ASIP; constraint programming; instruction selection; reconfigurable computing; scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Application-specific Systems, Architectures and Processors, 2009. ASAP 2009. 20th IEEE International Conference on
  • Conference_Location
    Boston, MA
  • ISSN
    2160-0511
  • Print_ISBN
    978-0-7695-3732-0
  • Electronic_ISBN
    2160-0511
  • Type

    conf

  • DOI
    10.1109/ASAP.2009.19
  • Filename
    5200022