Abstract
A common metric used for the assessment of overall reliability, in a memory hierarchy is the Mean To Failure (MTTF),but it doesn’t into accunt for time of data storage in each level. We propose another metric, Data Loss Rate (DLR), for this reason. We will derive a recurrent formula for computing DLR, and we will validate it by computer simulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Peter M Chen, David E.Lowell-“Reliability Hierarchies”, Workshop on Hot Topics in Operating Systems, 1999
Peter M Chen, Wee Teek Ng, Subhachandra Chandra, Christopher M. Aycock, Gurushankar Rajamani, and David Lowell - „The Rio File cache: Surviving operating System Crashes ”. In Proceedings of the 1996 International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 74-83, Octover 1996
Yiming HU Tucho Nightingale, Qing Yang. -„RAPID-Chache - A Reliable and Inexpensive Write Cache for High performance Storage Systems”, Iee Transactions on parallel and Distributed Systems, Vol. 13, No.2 pages 1-18, February 2002.
David A Paterson , John L Henessy-“Computer Arichitecture A Quantitative Approach”, Morgab Kaufmann Publishers, Inc 1990-1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Ovidiu, N., Mirceaast, G., Novac, M. (2006). Data Loss Rate versus Mean Time To Failure in Memory Hierarchies. In: Sobh, T., Elleithy, K. (eds) Advances in Systems, Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/1-4020-5263-4_48
Download citation
DOI: https://doi.org/10.1007/1-4020-5263-4_48
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-5262-0
Online ISBN: 978-1-4020-5263-7
eBook Packages: EngineeringEngineering (R0)