检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海大学计算机工程与科学学院,上海200072
出 处:《航空计算技术》2013年第1期69-72,共4页Aeronautical Computing Technique
基 金:上海市科委重点基金项目资助(10510500600);上海市重点学科建设项目资助(J50103)
摘 要:大规模数据的可视化一直是科学计算可视化中极具挑战性的一个研究领域,因为生成的计算数据常常太大不能一次性完全输入到计算机的内存中,以至于数据在快速内存和相对慢速的外存(比如磁盘)之间的输入和输出成为计算的一个瓶颈。在没有大内存高性能并行机但内存相对太小的PC机不能一次性装载可视化数据的情况下,提出了核外算法和可视化技术有机结合在PC机上大量数据的可视化,具体实现了核外算法在PC上对大量数据的局部分块显示、全局粗糙显示、局部分块和全局粗糙相结合显示、数据点的查找。实验验证了核外算法在PC机上对大量不可一次性导入内存的数据显示和数据查找上是一种简便、省时、高效的方法。Large- scale data visualization is always a challenge problem of the visualization in scientific computing. Due to the massive data produced by large- scale scientific and engineering computing, they are too large to fit into computer~ main memory at one time. As the result, the input/output communica- tion (I/O) between fast internal memory and slower external memory ( such as disk) can be a major per- formance bottleneck. In the condition without superpower computer of large memory, the memory of simple PC is too small to be used to load the visualization data. The combination of out- of- core algorithm and vi- sualization technique was developed in this paper, which realized the local partitioning visualization, over- all coarse visualization, combination of local partitioning and overall coarse visualization, and point see- king as well on simple PC. The experiments demonstrate that the out- of- core algorithm is an easy- used, time- saving and effective way to seek and visualize certain data among the large- scale data which could not be inputted into main memory at one time.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229