New replacement algorithm (LRU versus FIFO)
新的替换算法(LRU 与 FIFO)
The simulation results show that the algorithm based on expectation prediction value achieves higher prediction hit rate of cache and lower average waiting delay than the algorithm based on FIFO.
仿真实验结果表明,该算法与传统的FIFO算法相比较,提高了缓存的预测命中率,减少了用户平均等待延迟。
The algorithm is based on the list scheduling principle by developing job sequences for the first stage and queuing the remaining stages in a FIFO manner.
所提出的算法基于表调度原理,首先给出在第一级工件的排列顺序,并在其后的各级采用先入先出(FIFO)方式。
应用推荐