Sensitivity study of asynchronous algorithms in disk buffer cache memory

Abstract

Studies the sensitivity of asynchronous algorithms in disk buffer cache memory. The algorithms allow for writing the files into the buffer cache by the processes. The number of active processes in the system and the length of the queue to the disk buffer cache are considered in sensitivity study. This information is obtained dynamically during the execution of the algorithms. The time for a block to become available for updating in the buffer cache is given. The number of blocks available for updating in the buffer cache is derived. The performance of the algorithms is compared. It is shown that the proposed algorithms allow for better performance than an algorithm that does not use information about the system load.<>