p.1660
p.1664
p.1670
p.1675
p.1679
p.1683
p.1689
p.1693
p.1697
Theoretical Analysis of Resource Swap for Reuse Based Hardware Task Scheduling in Reconfigurable System
Abstract:
In reconfigurable system, hardware task placement algorithms are trying to find rectangle of available reconfigurable logic units in a fast manner. Furthermore, low cost and less fragmentation are another two metrics of high performance algorithm. In previous work we proposed a Transformable Vertexes Information based Algorithm (TVIA) for online task placement in reconfigurable system. In this paper, based on TVIA, we adopt Resource Swap scheme for reuse based hardware task scheduling. Hardware tasks will remain in the reconfigurable device after execution. Only when there is no enough space left for incoming tasks will previous tasks been swapped out from configurable device. This paper discusses the principle and procedure of resource swap management and compares several algorithms using simulation.
Info:
Periodical:
Pages:
1679-1682
Citation:
Online since:
March 2011
Authors:
Keywords:
Price:
Сopyright:
© 2011 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: