Tabu search with intensification strategy for functional partitioning in hardware-software codesign

被引：6

作者：

Wiangtong, T ^{[1
]}

Cheung, PYK ^{[1
]}

Luk, W ^{[1
]}

机构：

[1] Univ London Imperial Coll Sci Technol & Med, London, England

来源：

10TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/FPGA.2002.1106691

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents tabu search (TS) method with intensification strategy for hardware-software partitioning. The algorithm operates on functional blocks for designs represented as directed acyclic graphs (DAG), with the objective of minimising processing time under various hardware area constraints. Results are compared to two other heuristic search algorithms: genetic algorithm (GA) and simulated annealing (SA). The comparison involves a scheduling model based on list scheduling for calculating processing time used as a system cost, assuming that shared resource conflicts do not occur. The results show that TS, which rarely appears for solving this kind of problem, is superior to SA and GA in terms of both search time and the quality of solutions. In addition, we have implemented intensification strategy in TS called penalty reward, which can further improve the quality of results.

引用

页码：297 / 298

页数：2