Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

CORR
2010
Springer

favoriteEmaildiscussreport

141views Education» more CORR 2010»

FIFO anomaly is unbounded

13 years 11 months ago

FIFO anomaly is unbounded

Download www.acta.sapientia.ro

Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increases. Belady, Nelson and Shedler [5] constructed reference strings for which page replacement algorithm FIFO [10, 13, 36, 40] produces near twice more page faults in a larger memory than in a smaller one. They formulated the conjecture that 2 is a general bound. We prove that this ratio can be arbitrarily large.

Peter Fornai, Antal Iványi

Real-time Traffic

CORR 2010 | Education | Page | Page Faults | Page Replacement |

claim paper

Related Content

» Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

» Dataflow Architectures for GALS

» Stability of FIFO networks under adversarial models State of the art

» Verifying Programs with Unreliable Channels

» Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

» Indexed Predicate Discovery for Unbounded System Verification

» Learning to Verify Safety Properties

» On compiletime evaluation of process partitioning transformations for Kahn process network...

» MessagePassing Automata Are Expressively Equivalent to EMSO Logic

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Peter Fornai, Antal Iványi

Comments (0)