hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices
文献类型：期刊论文
| 作者 | Liu Peng ; Wu Jigang ; Wang Yongji |
| 刊名 | Mathematical and Computer Modelling
 |
| 出版日期 | 2012 |
| 页码 | - |
| 关键词 | Computer hardware Field programmable gate arrays (FPGA) Hardware Multitasking Response time (computer systems) Scheduling Scheduling algorithms Simulated annealing Tabu search |
| ISSN号 | 0895-7177 |
| 中文摘要 | Hardware/software (HW/SW) partitioning and scheduling are essential to embedded systems. In this paper, a hybrid algorithm derived from Tabu Search (TS) and Simulated Annealing (SA) is proposed for solving the HW/SW partitioning problem. The annealing procedure of SA is employed to accelerate the updating of Tabu tables for task scheduling, and the virtual hardware resource is also set to implement the customized TS. The Earliest-Deadline-First (EDF) strategy is introduced to describe the reconfiguration of FPGA. Moreover, an algorithm combining the Breadth-First-Search (BFS) with Depth-First-Search (DFS) is proposed for HW/SW task scheduling to fit the features of reconfigurable systems. Experimental results show that the improvement over the latest efficient combinatorial algorithm is up to 50%. The proposed virtual hardware expanding technique makes the performance increase up to 97.51% on random graphs. The improvement on task scheduling is by 50% in comparison to popular algorithms cited in this paper. © 2012 Elsevier Ltd. All rights reserved. |
| 英文摘要 | Hardware/software (HW/SW) partitioning and scheduling are essential to embedded systems. In this paper, a hybrid algorithm derived from Tabu Search (TS) and Simulated Annealing (SA) is proposed for solving the HW/SW partitioning problem. The annealing procedure of SA is employed to accelerate the updating of Tabu tables for task scheduling, and the virtual hardware resource is also set to implement the customized TS. The Earliest-Deadline-First (EDF) strategy is introduced to describe the reconfiguration of FPGA. Moreover, an algorithm combining the Breadth-First-Search (BFS) with Depth-First-Search (DFS) is proposed for HW/SW task scheduling to fit the features of reconfigurable systems. Experimental results show that the improvement over the latest efficient combinatorial algorithm is up to 50%. The proposed virtual hardware expanding technique makes the performance increase up to 97.51% on random graphs. The improvement on task scheduling is by 50% in comparison to popular algorithms cited in this paper. © 2012 Elsevier Ltd. All rights reserved. |
| 收录类别 | EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000320601000042 |
| 公开日期 | 2013-09-17 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15156]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Liu Peng,Wu Jigang,Wang Yongji. hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices[J]. Mathematical and Computer Modelling,2012:-. |
| APA | Liu Peng,Wu Jigang,&Wang Yongji.(2012).hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices.Mathematical and Computer Modelling,-. |
| MLA | Liu Peng,et al."hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices".Mathematical and Computer Modelling (2012):-. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。