.png){kind=icon}
返回
An efficient GPU-based parallel tabu search algorithm for hardware/software co-design
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-019-8184-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Hardware/software partitioning is an essential step in hardware/software co-design. For large size problems, it is difficult to consider both solution quality and time. This paper presents an efficient GPU-based parallel tabu search algorithm (GPTS) for HW/SW partitioning. A single GPU kernel of compacting neighborhood is proposed to reduce the amount of GPU global memory accesses theoretically. A kernel fusion strategy is further proposed to reduce the amount of GPU global memory accesses of GPTS. To further minimize the transfer overhead of GPTS between CPU and GPU, an optimized transfer strategy for GPU-based tabu evaluation is proposed, which considers that all the candidates do not satisfy the given constraint. Experiments show that GPTS outperforms state-of-the-art work of tabu search and is competitive with other methods for HW/SW partitioning. The proposed parallelization is significant when considering the ordinary GPU platform.
Keyword:
hardware
software co-design
hardware
software partitioning
graphics processing unit
GPU-based parallel tabu search
single kernel implementation
kernel fusion strategy
optimized transfer strategy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
Hardware/Software Codesign: The Past, the Present, and Predicting the Future.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏A novel region-based active contour model via local patch similarity measure for image segmentation一种基于局部块相似性度量的基于区域的活动轮廓模型，用于图像分割
PREAI
分享收藏
查看更多内容