Question

求译文，谢谢各位大虾

While certain "dynamic" algorithms can be applied as frequently as
permitted by the overhead costs. they fail to exploit important
characteristics that may exist in file referencing behaviour. A comparison
with virtual memory management algorithms is appropriate here. It has
been observed frequently that the memory reference patterns of executing
programs are non-random. Programs tend to refer only a small subset of
their pages over a significant execution interval, a phenomenon known as
locality of reference. This characteristic of memory referencing behaviour
has been exploited extensively in the design effective memory management
policies such as LRU. PFF [2]. and WS [3]. These use the notion of locality
to predict the future behaviour of programs and bring into main memory
only those pages that are likely to be referenced in the near future. In a
similar way it may be possible to base dynamic file assignment algorithms
on certain characteristics that may exist in file referencing behaviour. The
study of such characteristics may pave the way for more effective file
management techniques.
各位大虾，表去谷歌在线翻译一下就拿来呀，这样翻译有很多错误滴

Answer 1

当某些“动力”算法通常可以应用
上面的许可,他们不costs.开发重要
特征文件参考中可能存在的行为。比较
与虚拟内存管理算法适当的在这里。它有
经常被观察到的存储器引用的实施模式
程序中。程序只常常引用的一个子集
在一个重要的执行中,这一现象被称为间隔
当地的参考。内存参考的特性行为
已经被开拓了广泛地在设计有效的内存管理
LRU政策。[2]。PFF,是[3]。他们使用的概念的辨识力
预测未来的行为的项目,并纳入主要的记忆
只有那些页可能在不久的将来再发生。在
类似的方法,就有可能基地动态文件分配算法
在某些特征文件参考中可能存在的行为。这
研读这样特征可能铺平道路,为更有效的文件
管理技术。