.png){kind=icon}
返回
Kernel scheduling techniques for efficient solution space exploration in reconfigurable computing
.png){kind=icon}
PRE
AI
DOI：10.1016/S1383-7621(00)00050-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Run-time reconfigurable systems have emerged as a flexible way of facing with a single device a wide range of applications. The adequate exploitation of the available hardware resources requires the development of design tools that support the design process. Task scheduling becomes a very critical issue in achieving the high performance that DSP and multimedia applications demand. This paper addresses task scheduling in reconfigurable computing for these kinds of applications. First, we discuss the main issues involved in the problem. Then, we propose a new methodology with some bounding and pruning techniques in order to produce an efficient exploration of the design space. This work has been developed for Morphosys, a coarse-grain multi-context reconfigurable architecture, and it can be successfully applied to systems with similar features. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
reconfigurable computing
task scheduling
system-level
application partitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
暂无机构信息
引用论文
Fusion of double layered multiple laser range finders for people detection from a mobile robot双层多激光雷达融合用于移动机器人的人体检测
.png){kind=icon}
PREAI
分享收藏