Memory-Mapped File Approach for On-Demand Data Co-allocation on Grids

P. Chen, Jyh-Biau Chang, Yi-Chang Zhuang, C. Shieh, Tyng-Yeu Liang
{"title":"Memory-Mapped File Approach for On-Demand Data Co-allocation on Grids","authors":"P. Chen, Jyh-Biau Chang, Yi-Chang Zhuang, C. Shieh, Tyng-Yeu Liang","doi":"10.1109/CCGRID.2009.22","DOIUrl":null,"url":null,"abstract":"Grid data sharing systems usually provide a data-intensive application with either a pre-staging mechanism or an on-demand access mechanism to access shared data. Pre-staging systems simultaneously download an entire shared file from multiple data sources even when only a tiny file fragment is required. Such systems consume unnecessary data transmission time and storage space. On-demand access systems, on the other hand, download only the required fragments from a single data source. Such systems unfortunately do not fully exploit available network bandwidth. This paper presents a data sharing system, designated as the On-Demand data Co-Allocation (ODCA). ODCA facilitates an unmodified legacy applications to transparently access shared data by using native I/O system calls. ODCA transfers only the necessary fragments on user demand, thereby reducing data transmission time, avoiding wasted network bandwidth and wasted storage space. Moreover, ODCA reduces data waiting time by downloading the file fragments from multiple data sources. Experimental results show ODCA successfully reduces turnaround time in data-intensive applications.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCGRID.2009.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Grid data sharing systems usually provide a data-intensive application with either a pre-staging mechanism or an on-demand access mechanism to access shared data. Pre-staging systems simultaneously download an entire shared file from multiple data sources even when only a tiny file fragment is required. Such systems consume unnecessary data transmission time and storage space. On-demand access systems, on the other hand, download only the required fragments from a single data source. Such systems unfortunately do not fully exploit available network bandwidth. This paper presents a data sharing system, designated as the On-Demand data Co-Allocation (ODCA). ODCA facilitates an unmodified legacy applications to transparently access shared data by using native I/O system calls. ODCA transfers only the necessary fragments on user demand, thereby reducing data transmission time, avoiding wasted network bandwidth and wasted storage space. Moreover, ODCA reduces data waiting time by downloading the file fragments from multiple data sources. Experimental results show ODCA successfully reduces turnaround time in data-intensive applications.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
网格上按需数据协同分配的内存映射文件方法
网格数据共享系统通常为数据密集型应用程序提供预登台机制或按需访问机制来访问共享数据。预分级系统同时从多个数据源下载整个共享文件,即使只需要很小的文件片段。这种系统消耗了不必要的数据传输时间和存储空间。另一方面,按需访问系统只从单个数据源下载所需的片段。不幸的是,这样的系统不能充分利用可用的网络带宽。本文提出了一种数据共享系统,称为按需数据协同分配(ODCA)。ODCA允许未经修改的遗留应用程序通过使用本机I/O系统调用透明地访问共享数据。ODCA只根据用户需要传输必要的分片,从而减少数据传输时间,避免浪费网络带宽和存储空间。此外,ODCA通过从多个数据源下载文件片段来减少数据等待时间。实验结果表明,ODCA成功地减少了数据密集型应用程序的周转时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Visualization Scalability through Time Intervals and Hierarchical Organization of Monitoring Data Collusion Detection for Grid Computing Resource Information Aggregation in Hierarchical Grid Networks Distributed Indexing for Resource Discovery in P2P Networks Challenges and Opportunities on Parallel/Distributed Programming for Large-scale: From Multi-core to Clouds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1