Cache Replacement Policies Considering Small - Writes and Reference Counts for Software RAID File Systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 11, pp. 2849-2860, Nov. 1997
10.3745/KIPSTE.1997.4.11.2849,   PDF Download:

Abstract

In this paper, we present efficient cache replacement policies for the software RAID file system. The performance of this policies is compared to two other policies previously proposed for conventional file systems and adapted for the software RAID file system. As in hardware RAID systems, we found small-writes to be the performance bottleneck in software RAID file systems. To tackle this small-write problem, we propose cache replacement policies. Using trace driven simulations we show that the proposed policies improve performance in the aspect of the average response time and the average system busy time.


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]
K. J. Hoon, N. S. Hyuk, W. Y. Hun, "Cache Replacement Policies Considering Small - Writes and Reference Counts for Software RAID File Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 11, pp. 2849-2860, 1997. DOI: 10.3745/KIPSTE.1997.4.11.2849.

[ACM Style]
Kim Jong Hoon, Noh Sam Hyuk, and Won Yoo Hun. 1997. Cache Replacement Policies Considering Small - Writes and Reference Counts for Software RAID File Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 11, (1997), 2849-2860. DOI: 10.3745/KIPSTE.1997.4.11.2849.