检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京应用物理与计算数学研究所高性能计算中心,北京100094
出 处:《计算机工程与科学》2012年第8期160-165,共6页Computer Engineering & Science
基 金:国家高技术研究发展计划(2010AA012402);国家自然科学基金重点资助项目(61033009)
摘 要:在科学与工程计算中,在数千上万核上,模拟包含上亿网格单元的模型通常输出TB量级的时变数据集。这些数据集包含多个时刻的数据,每个时刻的数据分布存储在数千个文件,单时刻的数据量达到几GB甚至几十GB。为了并行地可视化这种时变数据集,本文设计了基于网格片的层次化数据结构,基于该数据结构改进和优化了并行可视化流程和数据通信算法。在集成到可视化软件后,实现了两个应用的模拟结果可视化。实测数据表明,对于单时刻5GB和32GB的数据,在数十上百个处理器核上,从数据读入到获得体绘制结果的时间分别为19秒和80秒,交互操作为2秒到10秒;三维面绘制在数秒钟内,切片分析在2秒以内。In scientific and engineering computing, some datasets generated by the simulations on tens of thousands of cores are measured in terabytes or even more. These datasets contain the data from multiple timesteps. The amount of each timestep dataset distributed to thousands of files is gigabytes or even tens of gigabytes. The hierarchical data structure based on the patch is designed to support the visualization of such scale dataset. And more, the parallel visualization pipeline and data communication algorithms are improved and optimized. Finally, two datasets coming from the code run on tens of thousands of cores are visualized. The measured result show that for the 5GB and 32GB data at single moments, on tens of thousands of processor cores, the time between the data imput and the result output is 19s and 80s respectively, and the interactive operation is between 2s and 10s; for the 3D rendering it is within several seconds, and the slicing is within 2s.
分 类 号:TP319[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222