Dynamic Bitmap for Huge File System


The KIPS Transactions:PartA, Vol. 9, No. 3, pp. 287-294, Sep. 2002
10.3745/KIPSTA.2002.9.3.287,   PDF Download:

Abstract

In this paper we propose a new mechanism for file system using a dynamic bitmap assignment. While traditional file systems rely on a fixed bitmap structures for metadata such as super block, inode, and directory entries, the proposed file system allocates bitmap and allocation area depends on file system features. Our approach gives a solution of the problem that the utilization of the file system depends on the file size in the traditional file systems. We show that the proposed mechanism is superior in the efficiency of disk usage compared to the traditional mechanisms.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. J. Lee, C. S. Park, B. J. Shin, G. B. Kim, "Dynamic Bitmap for Huge File System," The KIPS Transactions:PartA, vol. 9, no. 3, pp. 287-294, 2002. DOI: 10.3745/KIPSTA.2002.9.3.287.

[ACM Style]
Yong Ju Lee, Choon Seo Park, Bum Joo Shin, and Gyoung Bae Kim. 2002. Dynamic Bitmap for Huge File System. The KIPS Transactions:PartA, 9, 3, (2002), 287-294. DOI: 10.3745/KIPSTA.2002.9.3.287.