All Title Author
Keywords Abstract

Publish in OALib Journal
ISSN: 2333-9721
APC: Only $99

ViewsDownloads

Relative Articles

An Algebraic Hardware/Software Partitioning Algorithm

Hardware/Software Partitioning Algorithm Based on Path
基于路径的软硬件划分算法

Effective Multi-objective Genetic Algorithm for Hardware-software Partitioning
一种有效的面向多目标软硬件划分的遗传算法

Hardware/software task partitioning and scheduling algorithm on multi-core system on chip with reconfigurable hardware
一种集成可重构硬件的多核片上系统的软硬件任务划分与调度算法

New Approach for Hardware/Software Embedded System Conception Based on the Use of Design Patterns

Research of the method of software/hardware partitioning in the embedded system
嵌入式系统软硬件划分方法探索

MULTILEVEL BIONIC ALGORITHM FOR DETECTION AND IDENTIFICATION OF SOFTWARE AND HARDWARE IMPACTS ON TELECOMMUNICATION NETWORKS Многоуровневый бионический алгоритм для обнаружения и идентификации программно-аппаратных воздействий на информационно-телекоммуникационные сети

Efficient Heuristic and Tabu Search for Hardware/Software Partitioning
高效软硬件划分算法及其提升技术

A Method for Hardware/Software Partitioning of Embedded System in Two-level
在两个级别上对嵌入式系统应用进行硬件/软件划分

Applying Multi-Core Model Checking to Hardware-Software Partitioning in Embedded Systems (extended version)

More...

New Model and Algorithm for Hardware/Software Partitioning

Keywords: algorithm,hardware/software partitioning,dynamic programming,complexity

Full-Text   Cite this paper   Add to My Lib

Abstract:

This paper focuses on the algorithmic aspects for the hardware/software (HW/SW) partitioning which searches a reasonable composition of hardware and software components which not only satisfies the constraint of hardware area but also optimizes the execution time. The computational model is extended so that all possible types of communications can be taken into account for the HW/SW partitioning. Also, a new dynamic programming algorithm is proposed on the basis of the computational model, in which source data, rather than speedup in previous work, of basic scheduling blocks are directly utilized to calculate the optimal solution. The proposed algorithm runs in O(n A) for n code fragments and the available hardware area A. Simulation results show that the proposed algorithm solves the HW/SW partitioning without increase in running time, compared with the algorithm cited in the literature. Electronic supplementary material The online version of this article (doi:) contains supplementary material, which is available to authorized users.

Full-Text

comments powered by Disqus