FI-based file access predictor

An algorithm is proposed for the purpose of optimizing the availability of files to an operating system prior to their being required during execution by a running system. This algorithm is a first step in optimizing speed using a prefetching scheme based upon previous history of access. The technique described utilizes a mathematically based approach considering the actual occurrence of file application patterns. This technique was defined for pattern matching, and prefetching of files is indeed a pattern matching problem. We utilize the technique of Finite Inductive Sequences which is defined within the body of this paper. We also note that the formulation for the approach is defined and included, actual data for comparisons are still not completed as of the writing of this paper. However, we believe that the richness of this approach will be useful in considering how to prefetch multiple files for multiple applications under one system. Keywords Finite Inductive Sequences, File Acc...

• Type: Conference
• Year: 2009
• Where: ACMSE
• Authors: Jinsuk Baek, Paul S. Fisher, Mingyung Kwak
• Keywords: ACMSE 2009, Finite Inductive Sequences, Pattern Matching, Pattern Matching Problem, Theoretical Computer Science