...
首页> 外文期刊>Intelligent automation and soft computing >Variable Block Scheme for Minimizing File I/O
【24h】

Variable Block Scheme for Minimizing File I/O

机译:最小文件I / O的可变块方案

获取原文
获取原文并翻译 | 示例

摘要

In the conventional operating system, file modification overhead is very high because data block should be rewritten to the storage system when we delete or insert several bytes in disk system. To reduce the overhead of file modification, we have to provide byte stream operation to the block device, which can delete bytes of data without block-alignment consideration.In this paper, we explain a variable length block scheme to modify the contents of a file in a situation where some data is deleted. The variable length block is a technique that minimizes block writing by creating a bumper area in a block to save the contents of all files in a situation where some bytes are deleted and storing only the block where the modification occurred. With this approach, we can mimics byte stream operation on block-based disk storage system. In experiment result, we show that the performance of the proposed system is superior to conventional file system.
机译:在常规操作系统中,文件修改开销非常高,因为当我们在磁盘系统中删除或插入几个字节时,数据块应重写到存储系统中。为了减少文件修改的开销,我们必须向块设备提供字节流操作,该操作可以删除数据字节,而无需考虑块对齐。在本文中,我们解释了可变长度的块方案来修改文件的内容在某些数据被删除的情况下。可变长度块是通过在块中创建缓冲区域以在某些字节被删除的情况下保存所有文件的内容并仅存储发生修改的块的情况下最小化块写入的技术。通过这种方法,我们可以模拟基于块的磁盘存储系统上的字节流操作。实验结果表明,所提出系统的性能优于常规文件系统。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号