An algorithm of prediction by partial matching of storage systems

Cai Chen · 2000

The running time of many applications can not improve the processor speed if they need to access storage systems often.One way to deal with this dilemma is to predict pages that will be accessed and prefetched.Thus,storage access time can be reduced and applications can be run faster.This paper will introduce an algorithm of prediction by partial matching of storage systems.

Read the paper · More papers on PaperTik