Skip to main content

The MaStA I/O Cost Model and its Validation Strategy

  • Conference paper
Advances in Databases and Information Systems

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 59 Accesses

Abstract

Crash recovery in database systems aims to provide an acceptable level of protection from failure at a given engineering cost. A large number of recovery mechanisms are known, and have been compared both analytically and empirically. However, recent trends in computer hardware present different engineering tradeoffs in the design of recovery mechanisms. In particular, the comparative improvement in the speed of processors over disks suggests that disk I/O activity is the dominant expense. Furthermore, the improvement of disk transfer time relative to seek time has made patterns of disk access more significant. The contribution of the MaStA (Massachusetts St Andrews) cost model is that it is structured independently of machine architectures and application workloads. It determines costs in terms of I/O categories, access patterns and application workload parameters. The main features of the model are:

  • Cost is based upon a probabilistic estimation of disk activity, broken down into sequential, asynchronous, clustered synchronous, and unclustered synchronous disk accesses for each recovery scheme.

  • The model may be calibrated by different disk performance characteristics, either simulated, measured by experiment or predicted by analysis.

  • The model may be used over a wide variety of workloads, including those typical of object-oriented and database programming systems.

The paper contains a description of the model and illustrates its utility by analysing four recovery mechanisms, delivering performance predictions for these mechanisms when used for some specific workloads and execution platforms. The refinement of I/O cost into the various access patterns is shown to give qualitative predictions differing from those of uniform access time models. Further the results are shown to vary qualitatively between two commercially available configurations. The paper concludes by proposing a validation strategy for the model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R. & DeWitt, D. “Integrating Concurrency Control and Recovery Mechanisms: Design and Performance Evaluation”. ACM Transactions on Database Systems, Vol. 10, No. 4, December 1985, pp 529–564.

    Article  Google Scholar 

  2. Atkinson, M.P., Birnie, A., Jackson, N. & Philbrow, P.C. “Measuring Persistent Object Systems” In Proc. 5th International Workshop on Persistent Object Systems, San Miniato, Italy (1992). In Persistent Object Systems (Eds. A. Albano & R. Morrison). Springer-Verlag pp 63–85.

    Google Scholar 

  3. Brown, A.L. “Persistent Object Stores”. Ph.D. Thesis, University of St Andrews (1989).

    Google Scholar 

  4. Brown, A.L., Dearie, A., Morrison, R., Munro, D.S. & Rosenberg, J. “A Layered Persistent Architecture for Napier88”. International Workshop on Computer Architectures to Support Security and Persistence of Information, Universität Bremen, West Germany, (May 1990). In Security and Persistence. (Eds. J. Rosenberg & L. Keedy). Springer-Verlag, 155–172.

    Google Scholar 

  5. Brown, A.L. & Rosenberg, J. “Persistent Object Stores: An Implementation Technique”. In Dearie, Shaw, Zdonik (eds.), Implementing Persistent Object Bases, Principles and Practice, Morgan Kaufmann, 1991 pp 199–212.

    Google Scholar 

  6. Carey, M.J., DeWitt, D.J., Frank, D., Graefe, G., Muralikrishna, M., Richardson, J.E. & Shekita, E.J. “The Architecture of the EXODUS Extensible DBMS”. In Twelfth International Conference on Very Large Data Bases, 1986 pp 52–65.

    Google Scholar 

  7. Carey, M.J., DeWitt, D.J. & Naughton, J.F. “The 007 Benchmark”. In SIGMOD Conference on the Management of Data, 1993.

    Google Scholar 

  8. Cattell, R.G.G. & Skeen, J. “Object Operations Benchmark”. ACM Transactions on Database Systems 17,1 (1992) pp 1–31

    Article  Google Scholar 

  9. Challis, M.P. “Data Consistency and Integrity in a Multi-User Environment”. Databases: Improving Usability and Responsiveness, Academic Press, 1978.

    Google Scholar 

  10. Elhardt, K. & Bayer, R. “A Database Cache for High Performance and Fast Restart in Database Systems”. ACM Transactions on Database Systems, Vol. 9, No. 4, December 1984, Pages 503–525.

    Article  Google Scholar 

  11. Gray, J.N. “Notes on Database Operating Systems”. LNCS 60, Springer-Verlag (1978) pp 393–481.

    Google Scholar 

  12. Haerder, T. & Reuter, A. “Principles of Transaction-Oriented Database Systems”. ACM Computing Surveys, 15,4 (1983) pp 287–318.

    Article  MathSciNet  Google Scholar 

  13. Hagmann, R.B. “Reimplementing the Cedar file system using logging and group commit”. In Proc. 11th Symposium on Operating Systems Principles, 1987 pp 155–162.

    Chapter  Google Scholar 

  14. Kent, J., Garcia-Molina, H. & Chung, J. “An experimental evaluation of crash recovery mechanisms”. In Proc 4th ACM Symposium on Principles of Database Systems (1985) pp 113–122.

    Chapter  Google Scholar 

  15. Koch, B., Schunke, T., Dearie, A., Vaughan, F., Marlin, C., Fazakerley, R. & Barter C. “Cache Coherency and Storage Management in a Persistent Object System”, in Dearie, Shaw, Zdonik (eds.), Implementing Persistent Object Bases, Principles and Practice, Morgan Kaufmann, 1991 pp 103–113.

    Google Scholar 

  16. Lorie, A.L. “Physical Integrity in a Large Segmented Database”. ACM Transactions on Database Systems, 2,1 (1977) pp 91–104.

    Article  Google Scholar 

  17. Morrison, R., Brown, A.L., Connor, R.C.H. & Dearie, A. “The Napier88 Reference Manual”. University of St Andrews Technical Report PPRR-77–89 (1989).

    Google Scholar 

  18. Moss, J.E.B. & Sinofsky, S. “Managing persistent data with Mneme: Designing a reliable shared object interface”. In Dittrich, K.R. (ed.) Advances in Object-Oriented Database Systems: Second International Workshop on Object-Oriented Database Systems, LNCS 334, Springer-Verlag, 1988 pp 298–316.

    Google Scholar 

  19. Munro, D.S., Connor, R.C.H., Morrison, R., Scheuert, S. & Stemple, D.W. “Concurrent Shadow Paging in the Flask Architecture”. To appear in Proc. 6th International Workshop on Persistent Object Systems, Tarascon, France (1994).

    Google Scholar 

  20. Munro, D.S. “On the Integration of Concurrency, Distribution and Persistence”. Ph.D. Thesis, University of St Andrews (1993).

    Google Scholar 

  21. O’Toole, J. & Shrira, L. “Opportunistic Log: Efficient Installation Reads in a Reliable Object Server”. Technical Report MIT/LCS-TM-506, March 1994. To appear in 1st International Symposium on Operating Systems Design and Implementation, Monterey, CA (1994).

    Google Scholar 

  22. Reuter, A. “Performance Analysis of Recovery Techniques”. ACM Transactions on Database Systems, 9,4 (1984), pp 526–559.

    Article  MathSciNet  Google Scholar 

  23. Rosenberg J., Henskens F., Brown A.L., Morrison R. & Munro D.S. “Stability in a Persistent Store Based on a Large Virtual Memory.”. International Workshop on Computer Architectures to Support Security and Persistence of Information, Universität Bremen, West Germany, (May 1990). In Security and Persistence. (Eds: J. Rosenberg & L. Keedy). Springer-Verlag pp 229–245.

    Chapter  Google Scholar 

  24. Rosenblum, M. & Ousterhout, J.K. “The design and implementation of a logstructured file system”. In Proc 13th Symposium on Operating Systems Principles, 1991 pp 1–15.

    Google Scholar 

  25. Severance, D. “A Practical Guide to the Design of Differential Files for Recovery of On-line Databases”. ACM Transactions on Database Systems, 7,4 (1982) pp 540–565.

    Article  MATH  Google Scholar 

  26. Scheuerl, S., Connor R.C.H., Morrison, R., Moss, J.E.B. & Munro, D.S. “MaStA — An I/O Cost Model for Database Crash Recovery Mechanisms” Technical Report CS/95/1 (1995), University of St Andrews.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 British Computer Society

About this paper

Cite this paper

Scheuerl, S., Connor, R.C.H., Morrison, R., Moss, J.E.B., Munro, D.S. (1996). The MaStA I/O Cost Model and its Validation Strategy. In: Eder, J., Kalinichenko, L.A. (eds) Advances in Databases and Information Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-1486-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1486-4_21

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-76014-6

  • Online ISBN: 978-1-4471-1486-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics