Please use this identifier to cite or link to this item:
|Title:||Algorithmic aspects for multiple-choice hardware/software partitioning||Authors:||Wu, Jigang
|Keywords:||DRNTU::Engineering::Computer science and engineering||Issue Date:||2012||Source:||Wu, J., Sun, Q.,& Srikanthan, T. (2012). Algorithmic aspects for multiple-choice hardware/software partitioning. Computers & Operations Research, 39(12), 3281-3292.||Series/Report no.:||Computers & operations research||Abstract:||Hardware–software partitioning (HW/SW) divides an application into software and hardware. It is one of the crucial steps in embedded system design. For a given task, hardware with different areas may provide different execution speeds due to the potential of parallel execution in hardware implementation. Thus, one task may have multiple-choice in hardware implementation according to the available hardware areas. Existing HW/SW partitioning approaches typically consider only a single implementation manner in hardware, overlooking the multiple-choice of hardware implementations. This paper presents a computing model to cater for the HW/SW partitioning problems with the multiple-choice implementation in hardware. An efficient heuristic algorithm is proposed to rapidly generate approximate solution, that is further refined by a tabu search algorithm also customized in this paper. Moreover, a dynamic programming algorithm is proposed for the exact solution of the relatively small problems. Extensive simulation results show that the approximate solutions are very close to the exact ones, and they can be refined by tabu search to the solutions with the error no more than 1.5% for all cases considered in this paper.||URI:||https://hdl.handle.net/10356/97336
|ISSN:||0305-0548||DOI:||http://dx.doi.org/10.1016/j.cor.2012.04.013||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.