I/O Buffer Partitioning Using Buffer Access Information for Directory Oriented Buffer Cache Mechanism
-
- YOKOYAMA Kazutoshi
- Kochi University of Technology
-
- TSUCHIYA Akiyoshi
- Okayama University
-
- YAMAMOTO Koichi
- Okayama University
-
- KAWABE Seiya
- Okayama University
-
- YAMAUCHI Toshihiro
- Okayama University
-
- NOMURA Yoshinari
- Okayama University
-
- TANIGUCHI Hideo
- Okayama University
Bibliographic Information
- Other Title
-
- ディレクトリ優先方式における未参照バッファ数に着目した入出力バッファ分割法
Description
Directory oriented I/O buffer partitioning is an effective strategy in case a few hi-priority tasks have their individual directories in which almost all required files are stored. The basic idea is to partition the I/O buffer into two types of pools called protected pool and normal pool. Protected pool is dedicated to the files in the high priority directories that are frequently accessed by these high priority tasks. However, in some cases, the basic mechanism seriously decreases its overall performance due to the starvation of normal pool. In this paper, we improve the basic mechanism to prevent the starvation by controlling the size-ratio between protected pool and normal pool. We also implement the improved mechanism and perform some experiments. Experimental results show that the proposed method has better performance than the LRU, and prevents a significant slowdown of the low-priority tasks.
Journal
-
- 電子情報通信学会論文誌D 情報・システム
-
電子情報通信学会論文誌D 情報・システム J101-D (1), 46-56, 2018-01-01
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390002212174019584
-
- ISSN
- 18810225
- 18804535
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
-
- Abstract License Flag
- Disallowed