检索结果-南通市图书馆

检索条件"主题词=sub-graph"

共 2 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

graph Reduction Algorithm for Hardware/Software Partitioning

Graph Reduction Algorithm for Hardware/Software Partitioning

引用

2011 International Conference on Control, Automation and Systems Engineering(CASE)

作者： Hui Li Wenju Liu Honglei Han Computer Science and Software Institution Tianjin Polytechnic University

One of the most crucial steps in the design of embedded systems is Hardware/Software(HW/SW) partitioning, that is, deciding which components of the system should be implemented in hardware and which ones in software. Most formulations of the HW/SW partitioning problem are NP-hard, so most of the research efforts on HW/SW partitioning has focused on developing efficient heuristic. In this paper, we did not committed to finding effective methods of HW/SW partitioning, but focusing on the pre-process for the task graph before the HW/SW partitioning, and to find all the sub-graphs which meet the requirements. Simplification of the original task graph, so that the partitioning will be more accurately and faster, and it also can save the hardware area effectively.

关键词： HW/SW partitioning task graph pre-process sub-graph

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

graph Reduction Algorithm for Hardware/Software Partitioning

Graph Reduction Algorithm for Hardware/Software Partitioning

引用

2011 2nd Asia-Pacific Conference on Wearable Computing Systems (APWCS 2011);2011 International Conference on Intelligent Control and Information Technology(ICICIT 2011)

作者： Hui Li Wenju Liu Honglei Han Computer Science and Software Institution Tianjin Polytechnic University

One of the most crucial steps in the design of embedded systems is Hardware/Software（HW/SW） partitioning,that is,deciding which components of the system should be implemented in hardware and which ones in *** formulations of the HW/SW partitioning problem are NP-hard,so most of the research efforts on HW/SW partitioning has focused on developing efficient *** this paper,we did not committed to finding effective methods of HW/SW partitioning,but focusing on the pre-process for the task graph before the HW/SW partitioning,and to find all the sub-graphs which meet the *** of the original task graph,so that the partitioning will be more accurately and faster,and it also can save the hardware area effectively.

关键词： HW/SW partitioning task graph pre-process sub-graph

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

回到顶部

执行限定条件

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：