Loading…

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:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c2056-d25943044019f1df015a0b5faee670dc5aa4e4471d054f9063276c1bc874640a3
container_end_page 4
container_issue 1
container_start_page 3
container_title Operating systems review
container_volume 31
creator ROBINSON, J. T
DEVARAKONDA, M. V
description 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.
doi_str_mv 10.1145/254784.254786
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29405991</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29405991</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2056-d25943044019f1df015a0b5faee670dc5aa4e4471d054f9063276c1bc874640a3</originalsourceid><addsrcrecordid>eNo9kEFLxDAQhYMouK4evecgeuo6k07S5qiLq8KiIAreSjZNtJJt16SL-O_tWvH0DcObN4_H2CnCDJHkpZBUlDT7hdpjE9SUZ7JUr_tsAqiGWZdwyI5S-gDAEhVOmHjoese7lhu-id0quDX_avp3Hp2ruWlrHrr27SLxxfXTsEvb0KdjduBNSO7kj1P2srh5nt9ly8fb-_nVMrMCpMpqIYf_QASoPdYeUBpYSW-cUwXUVhpDjqjAGiR5DSoXhbK4smVBisDkU3Y--g7BPrcu9dW6SdaFYFrXbVMlNIHUGgdhNgpt7FKKzleb2KxN_K4Qql0z1djMCDXoz_6MTbIm-Gha26T_IyF3UYr8B1U2X2M</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29405991</pqid></control><display><type>article</type><title>Note on a problem with reed and long's FBR results</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>ROBINSON, J. T ; DEVARAKONDA, M. V</creator><creatorcontrib>ROBINSON, J. T ; DEVARAKONDA, M. V</creatorcontrib><description>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.</description><identifier>ISSN: 0163-5980</identifier><identifier>EISSN: 1943-586X</identifier><identifier>DOI: 10.1145/254784.254786</identifier><identifier>CODEN: OSRED8</identifier><language>eng</language><publisher>New York, NY: Association for Computing Machinery</publisher><subject>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</subject><ispartof>Operating systems review, 1997, Vol.31 (1), p.3-4</ispartof><rights>1997 INIST-CNRS</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2056-d25943044019f1df015a0b5faee670dc5aa4e4471d054f9063276c1bc874640a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,780,784,789,790,4050,4051,23930,23931,25140,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=2563277$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>ROBINSON, J. T</creatorcontrib><creatorcontrib>DEVARAKONDA, M. V</creatorcontrib><title>Note on a problem with reed and long's FBR results</title><title>Operating systems review</title><description>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.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Computer systems performance. Reliability</subject><subject>Exact sciences and technology</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0163-5980</issn><issn>1943-586X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNo9kEFLxDAQhYMouK4evecgeuo6k07S5qiLq8KiIAreSjZNtJJt16SL-O_tWvH0DcObN4_H2CnCDJHkpZBUlDT7hdpjE9SUZ7JUr_tsAqiGWZdwyI5S-gDAEhVOmHjoese7lhu-id0quDX_avp3Hp2ruWlrHrr27SLxxfXTsEvb0KdjduBNSO7kj1P2srh5nt9ly8fb-_nVMrMCpMpqIYf_QASoPdYeUBpYSW-cUwXUVhpDjqjAGiR5DSoXhbK4smVBisDkU3Y--g7BPrcu9dW6SdaFYFrXbVMlNIHUGgdhNgpt7FKKzleb2KxN_K4Qql0z1djMCDXoz_6MTbIm-Gha26T_IyF3UYr8B1U2X2M</recordid><startdate>1997</startdate><enddate>1997</enddate><creator>ROBINSON, J. T</creator><creator>DEVARAKONDA, M. V</creator><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1997</creationdate><title>Note on a problem with reed and long's FBR results</title><author>ROBINSON, J. T ; DEVARAKONDA, M. V</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2056-d25943044019f1df015a0b5faee670dc5aa4e4471d054f9063276c1bc874640a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Computer systems performance. Reliability</topic><topic>Exact sciences and technology</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>online_resources</toplevel><creatorcontrib>ROBINSON, J. T</creatorcontrib><creatorcontrib>DEVARAKONDA, M. V</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Operating systems review</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ROBINSON, J. T</au><au>DEVARAKONDA, M. V</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Note on a problem with reed and long's FBR results</atitle><jtitle>Operating systems review</jtitle><date>1997</date><risdate>1997</risdate><volume>31</volume><issue>1</issue><spage>3</spage><epage>4</epage><pages>3-4</pages><issn>0163-5980</issn><eissn>1943-586X</eissn><coden>OSRED8</coden><abstract>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.</abstract><cop>New York, NY</cop><pub>Association for Computing Machinery</pub><doi>10.1145/254784.254786</doi><tpages>2</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0163-5980
ispartof Operating systems review, 1997, Vol.31 (1), p.3-4
issn 0163-5980
1943-586X
language eng
recordid cdi_proquest_miscellaneous_29405991
source Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
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
title Note on a problem with reed and long's FBR results
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T09%3A41%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Note%20on%20a%20problem%20with%20reed%20and%20long's%20FBR%20results&rft.jtitle=Operating%20systems%20review&rft.au=ROBINSON,%20J.%20T&rft.date=1997&rft.volume=31&rft.issue=1&rft.spage=3&rft.epage=4&rft.pages=3-4&rft.issn=0163-5980&rft.eissn=1943-586X&rft.coden=OSRED8&rft_id=info:doi/10.1145/254784.254786&rft_dat=%3Cproquest_cross%3E29405991%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2056-d25943044019f1df015a0b5faee670dc5aa4e4471d054f9063276c1bc874640a3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=29405991&rft_id=info:pmid/&rfr_iscdi=true