Size Minimization Problems for Reconfigurable Devices
Date Issued
2008
Date
2008
Author(s)
Li, Yun-Hao
Abstract
Reconfiguration has become an important and practical issue in product designs and their lifetime. In this paper, we target an essential issue in the reconfiguration designs of embedded systems. In particular, we explore the size minimization problems of reconfigurable devices in partial reconfiguration schedules We identify factors that contribute to the NP-hardness of the problems. We first present problems with efficient algorithms and theirolutions. We then address factors for NP-hardness and provide some proofs. A simulated annealing algorithm is later proposed to serve as a comparison with heuristics-based algorithm to provide insights in system designs. A series of extensive simulation experiments and a case study are presented to provide insights and comparisons among different approaches.
Subjects
reconfigurable device
embedded system
partial reconfiguration
minimization
simulated annealing
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-P94922010-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):46e75f4378103be6d33734b67b644ab9