Considering the frequency dimension into on demand adaptive algorithms

Abstract

Efficient memory usage in high performance timesharing computing systems is a considerable challenge. Some research areas on adaptive algorithms concerning memory page replacement, analyze the memory access behavior seeking to store the pages that will be used in a near future and discarding the others. This is important due to the high cost of treating page faults. The proposal is to analyze the influence of page access frequency on adaptive algorithms, using its structure and applying page replacement with access frequency analysis, as a function of its execution state. The comparative performance analysis is conducted by using trace files that represent different memory access behaviors.