Note on a problem with reed and long's FBR results

This short note discusses a problem we found in a recent article in Operating Systems Review [1]. The problem is related to apparent inconsistencies in results presented for a data cache algorithm, known as FBR (frequency based replacement), which we first described in [2]. A property of this algori...

Full description

Saved in:
Bibliographic Details
Published in:Operating systems review 1997, Vol.31 (1), p.3-4
Main Authors: ROBINSON, J. T, DEVARAKONDA, M. V
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Computer systems performance. Reliability
Exact sciences and technology
Memory and file management (including protection and security)
Memory organisation. Data processing
Software
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This short note discusses a problem we found in a recent article in Operating Systems Review [1]. The problem is related to apparent inconsistencies in results presented for a data cache algorithm, known as FBR (frequency based replacement), which we first described in [2]. A property of this algorithm is that cache miss ratios obtained using FBR can be related to LRU cache miss ratios for any given trace. Application of this property to the results in [1] reveals apparent inconsistencies. These inconsistencies could be the result of errors either in implementing the algorithm or in recording the results. This note also highlights this property of FBR, which should help contribute to its understanding.
ISSN:0163-5980
1943-586X
DOI:10.1145/254784.254786