IMECH-IR  > 高温气体动力学国家重点实验室
基于OpenCL的并行方腔流加速性能分析
Alternative TitlePerformance analysis of OpenCL parallel acceleration on cavity flow problem
李森; 李新亮; 王龙; 陆忠华; 迟学斌
Source Publication计算机应用研究
2011-04-15
Volume28Issue:4Pages:1401-1403,1421
ISSN1001-3695
Abstract提出了一种使用OpenCL技术对方腔流问题进行加速计算的方法.在计算方腔流问题时,将其转换为N-S方程通过空间有限差分和龙格库塔时间差分求解,并使用局部缓存等技术进行GPU优化.实验在NVIDIA和ATI平台对所给算法进行评测.结果显示, OpenCL相对其串行版本加速约30倍左右
Other AbstractThis paper proposed a new approach to accelerate cavity flow problem using OpenCL technology.This paper transformed the cavity flow problem into N-S equation and solved it by finite difference method.During this procedure,used local memory and other techniques to accelerate the code.This paper ran the program on both NVIDIA and ATI platforms.The experiment shows a 30x times speed up.
Keyword显卡通用计算 计算流体力学 方腔流 有限差分计算
Subject Area力学
URL查看原文
Indexed ByCSCD
Language中文
Funding OrganizationCNIC主任基金资助项目(CNIC_ZR_09005)
CSCD IDCSCD:4166341
DepartmentLHD应用等离子体力学(CPCR);LHD可压缩湍流
Citation statistics
Cited Times:2[CSCD]   [CSCD Record]
Document Type期刊论文
Identifierhttp://dspace.imech.ac.cn/handle/311007/45190
Collection高温气体动力学国家重点实验室
Corresponding Author李森
Recommended Citation
GB/T 7714
李森,李新亮,王龙,等. 基于OpenCL的并行方腔流加速性能分析[J]. 计算机应用研究,2011,28(4):1401-1403,1421.
APA 李森,李新亮,王龙,陆忠华,&迟学斌.(2011).基于OpenCL的并行方腔流加速性能分析.计算机应用研究,28(4),1401-1403,1421.
MLA 李森,et al."基于OpenCL的并行方腔流加速性能分析".计算机应用研究 28.4(2011):1401-1403,1421.
Files in This Item: Download All
File Name/Size DocType Version Access License
C2011J076.pdf(2372KB)期刊论文作者接受稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[李森]'s Articles
[李新亮]'s Articles
[王龙]'s Articles
Baidu academic
Similar articles in Baidu academic
[李森]'s Articles
[李新亮]'s Articles
[王龙]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[李森]'s Articles
[李新亮]'s Articles
[王龙]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: C2011J076.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.