Experiments using several LRU-unfriendly page reference sequences show that the AWL algorithm is superior to LRU algorithm, and using several LRU-friendly, unfriendly page reference sequences show that the AWL algorithm approximates to LRU algorithm.

• 并用实验验证在LRU-不友好页面访问序列下,AWL算法的缺页失败次数较LRU算法有大幅度的降低; 在LRU-友好页面访问序列和不友好页面访问序列下,AWL算法的缺页失败次数近似于LRU算法。