Theoretical Analysis of Resource Swap for Reuse Based Hardware Task Scheduling in Reconfigurable System

Abstract:

Article Preview

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:

Advanced Materials Research (Volumes 219-220)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

1679-1682

DOI:

10.4028/www.scientific.net/AMR.219-220.1679

Citation:

T. T. Fu and P. Liu, "Theoretical Analysis of Resource Swap for Reuse Based Hardware Task Scheduling in Reconfigurable System", Advanced Materials Research, Vols. 219-220, pp. 1679-1682, 2011

Online since:

March 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.