网络数据存储布局

Ming Hu, Minghua Jiang
{"title":"网络数据存储布局","authors":"Ming Hu, Minghua Jiang","doi":"10.1109/IITA.2007.74","DOIUrl":null,"url":null,"abstract":"FRAID is proposed a networked data storage layout in which new i-node provides four file layout types: non-striping, non-striped mirroring, stripping, and striped mirroring for user to choose. FRAID provides the three-level accessing mechanism and functional agents by clients, data servers, and object-based storage devices and the two-level storage allocation strategy of block and segment. It makes not only users possible to choose the proper layout according to the content of file data for their access efficiency and availability, but also the distributed storage system improve the accessing performance.","PeriodicalId":191218,"journal":{"name":"Workshop on Intelligent Information Technology Application (IITA 2007)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"FRAID: A Networked Data Storage Layout\",\"authors\":\"Ming Hu, Minghua Jiang\",\"doi\":\"10.1109/IITA.2007.74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"FRAID is proposed a networked data storage layout in which new i-node provides four file layout types: non-striping, non-striped mirroring, stripping, and striped mirroring for user to choose. FRAID provides the three-level accessing mechanism and functional agents by clients, data servers, and object-based storage devices and the two-level storage allocation strategy of block and segment. It makes not only users possible to choose the proper layout according to the content of file data for their access efficiency and availability, but also the distributed storage system improve the accessing performance.\",\"PeriodicalId\":191218,\"journal\":{\"name\":\"Workshop on Intelligent Information Technology Application (IITA 2007)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Intelligent Information Technology Application (IITA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IITA.2007.74\",\"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 Intelligent Information Technology Application (IITA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IITA.2007.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

FRAID提出了一种网络化的数据存储布局,其中新的i-node提供了四种文件布局类型:非分条镜像、非分条镜像、分条镜像和分条镜像供用户选择。FRAID提供了客户端、数据服务器和对象存储设备三级访问机制和功能代理,以及块和段两级存储分配策略。它不仅使用户可以根据文件数据的内容选择合适的布局,提高访问效率和可用性,而且分布式存储系统提高了访问性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FRAID: A Networked Data Storage Layout
FRAID is proposed a networked data storage layout in which new i-node provides four file layout types: non-striping, non-striped mirroring, stripping, and striped mirroring for user to choose. FRAID provides the three-level accessing mechanism and functional agents by clients, data servers, and object-based storage devices and the two-level storage allocation strategy of block and segment. It makes not only users possible to choose the proper layout according to the content of file data for their access efficiency and availability, but also the distributed storage system improve the accessing performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信