科学模拟的有效输入和输出

S. Kuo, M. Winslett, Yong Cho, Jonghyun Lee, Ying Chen
{"title":"科学模拟的有效输入和输出","authors":"S. Kuo, M. Winslett, Yong Cho, Jonghyun Lee, Ying Chen","doi":"10.1145/301816.301828","DOIUrl":null,"url":null,"abstract":"Large simulations which run for hundreds of hours on paralle l computers often periodically generate snapshots of states, wh ich are later post-processed to visualize the simulated physical p henomenon. For many applications, fast I/O during post-processing, wh ich is dependent on an efficient organization of data on disk, is as i mportant as minimizing computation-time I/O. In this paper we pr opose optimizations to support efficient parallel I/O for scienti fic simulations and subsequent visualizations. We present an orderin g mechanism to linearize data on disk, a performance model to help t o choose a proper stripe unit size, and a scheduling algorithm to inimize communication contention. Our experiments on an IBM S P show that the combination of these strategies provides a 2025% performance boost.","PeriodicalId":442608,"journal":{"name":"Workshop on I/O in Parallel and Distributed Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Efficient input and output for scientific simulations\",\"authors\":\"S. Kuo, M. Winslett, Yong Cho, Jonghyun Lee, Ying Chen\",\"doi\":\"10.1145/301816.301828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Large simulations which run for hundreds of hours on paralle l computers often periodically generate snapshots of states, wh ich are later post-processed to visualize the simulated physical p henomenon. For many applications, fast I/O during post-processing, wh ich is dependent on an efficient organization of data on disk, is as i mportant as minimizing computation-time I/O. In this paper we pr opose optimizations to support efficient parallel I/O for scienti fic simulations and subsequent visualizations. We present an orderin g mechanism to linearize data on disk, a performance model to help t o choose a proper stripe unit size, and a scheduling algorithm to inimize communication contention. Our experiments on an IBM S P show that the combination of these strategies provides a 2025% performance boost.\",\"PeriodicalId\":442608,\"journal\":{\"name\":\"Workshop on I/O in Parallel and Distributed Systems\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on I/O in Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/301816.301828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on I/O in Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/301816.301828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

在并行计算机上运行数百小时的大型模拟通常会周期性地生成状态快照,这些快照稍后会被后处理以可视化模拟的物理现象。对于许多应用程序,后处理期间的快速I/O(这依赖于磁盘上数据的有效组织)与最小化计算时间I/O同样重要。在本文中,我们提出了优化,以支持科学模拟和后续可视化的高效并行I/O。我们提出了一个排序机制来线性化磁盘上的数据,一个性能模型来帮助选择合适的条带单元大小,以及一个调度算法来最大限度地减少通信争用。我们在IBM S - P上的实验表明,这些策略的组合提供了2025%的性能提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient input and output for scientific simulations
Large simulations which run for hundreds of hours on paralle l computers often periodically generate snapshots of states, wh ich are later post-processed to visualize the simulated physical p henomenon. For many applications, fast I/O during post-processing, wh ich is dependent on an efficient organization of data on disk, is as i mportant as minimizing computation-time I/O. In this paper we pr opose optimizations to support efficient parallel I/O for scienti fic simulations and subsequent visualizations. We present an orderin g mechanism to linearize data on disk, a performance model to help t o choose a proper stripe unit size, and a scheduling algorithm to inimize communication contention. Our experiments on an IBM S P show that the combination of these strategies provides a 2025% performance boost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信