• DocumentCode
    2743230
  • Title

    Dependency Aware Placement in Reconfigurable Computing Systems

  • Author

    Lotfifar, Foad ; Shahhoseini, Hadi Shahriar ; Khanzadi, Himan

  • Author_Institution
    Electr. Eng. Dept., Iran Univ. of Sci. & Technol., Tehran, Iran
  • fYear
    2011
  • fDate
    25-27 Jan. 2011
  • Firstpage
    272
  • Lastpage
    276
  • Abstract
    Taking into account inter-task dependency in reconfigurable computing systems, a step closer to reality, can interfere with placement algorithm and it highly affects on hardware resource utilization. In this paper a tree based placement algorithm is proposed that its specifications are efficiency and low execution time. The main feature of this placement algorithm is that it is easy and simple to implement. Furthermore, the effects of inter-task dependency on speed and hardware resource utilization are investigated, which are important in pursuing appropriate policies for task placement based on various workload characterization. Finally, based on simulation results, we show that which strategy (considering dependency or not) is better in different system conditions.
  • Keywords
    computational complexity; reconfigurable architectures; redundancy; resource allocation; tree data structures; trees (mathematics); dependency aware placement; hardware resource utilization; intertask dependency; reconfigurable computing system; tree based placement algorithm; Algorithm design and analysis; Complexity theory; Computational modeling; Hardware; Routing; Simulation; Strontium; partial reconfiguration; placement; reconfigurable hardware; reconfigurable system; task dependency;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Systems, Modelling and Simulation (ISMS), 2011 Second International Conference on
  • Conference_Location
    Kuala Lumpur
  • Print_ISBN
    978-1-4244-9809-3
  • Type

    conf

  • DOI
    10.1109/ISMS.2011.82
  • Filename
    5730359