FFU: far-future-using replacement algorithms for continuous media storage system
Taeck-Geun Kwon, Suk‐Ho Lee · 2002
It is true that some conventional algorithms do not fit in continuous media (CM) environments because of their different properties. A typical example is the buffer replacement algorithms such as least recently used (LRU) and most recently used (MRU) strategies. These replacement policies are based on the referencing history for replacing buffered page with lower priority because it is not always possible to predict when a buffered page will be re-referred in a traditional DBMS. In contrast, since a CM storage system accesses CM segments sequentially, it can replace buffered segments which will not be re-referred in the near future. The idea of a far-future-using (FFU) buffer replacement algorithm is to share the buffer for concurrent transactions and to keep segments in the order of a re-referencing plan. We analyze the FFU buffer replacement algorithm for CM playback in terms of buffer hit ratio and required buffer size in comparison with LRU and MRU.