Skip to main content

Performance Analysis of Storage Systems

  • Chapter
  • First Online:
Book cover Performance Evaluation: Origins and Directions

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1769))

Abstract

By “performance analysis of a storage system,” we mean the application of a variety of approaches to predict, assess, evaluate, and explain the system’s performance characteristics, along dimensions such as throughput, latency, and bandwidth. Several approaches are commonly used. One approach is analytical modeling, which is the writing of equations that predict performance variables as a function of parameters of the workload, equipment, and system configuration. Another approach is to collect measurements of a running system, and to observe the relationship between characteristics of the workload and the system components, and the resulting performance measurements. A third approach is simulation, in which a computer program implements a simplified representation of the behavior of the components of the storage system, and then a synthetic or actual workload is applied to the simulation program, so that the performance of the simulated components and system can be measured. Trace-driven simulation is an approach that controls a simulation model by feeding in a trace—a sequence of specific events at specific time intervals. The trace is typically obtained by collecting measurements from an actual running system.

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. E. Shriver, Performance modeling for realistic storage devices. PhD thesis, New York University, Department of Computer Science, May 1997. Available at http://www.bell-labs.com/~shriver/.

  2. C. Ruemmler and J. Wilkes, “An introduction to disk drive modeling,” IEEE Computer, vol. 27, pp. 17–28, Mar. 1994.

    Google Scholar 

  3. D. A. Patterson, G. Gibson, and R. H. Katz, “A case for redundant arrays of inexpensive disks (RAID),” in Proceedings of 1988 SIGMOD International Conference on Management of Data (H. Boral and P.-A. Larson, eds.), (Chicago, IL), pp. 109–116, June 1988.

    Google Scholar 

  4. P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson, “RAID: high-performance, reliable secondary storage,” ACM Computing Surveys, vol. 26, pp. 145–185, June 1994.

    Article  Google Scholar 

  5. C. Ruemmler and J. Wilkes, “Unix disk access patterns,” in Proceedings of the Winter 1993 USENIX Conference, (San Diego, CA), pp. 405–420, USENIX Association, Berkeley, CA, Jan. 1993.

    Google Scholar 

  6. S. W. Ng, “Improving disk performance via latency reduction,” IEEE Transactions on Computers, vol. 40, pp. 22–30, Jan. 1991.

    Article  Google Scholar 

  7. B. Seeger, “An analysis of schedules for performing multi-page requests,” Information Systems, vol. 21, pp. 387–407, July 1996.

    Article  MathSciNet  Google Scholar 

  8. A. Merchant and P. S. Yu, “Analytic modeling of clustered RAID with mapping based on nearly random permutation,” IEEE Transactions on Computers, vol. 45, pp. 367–373, Mar. 1996.

    Article  MATH  Google Scholar 

  9. C. C. Gotlieb and G. H. MacEwen, “Performance of movable-head disk storage systems,” Journal of the ACM, vol. 20, pp. 604–623, Oct. 1973.

    Article  MATH  Google Scholar 

  10. J. L. Hennessy and D. A. Patterson, Computer architecture: a quantitative approach. Morgan Kaufmann Publishers, Incorporated, San Mateo, CA, 1990.

    Google Scholar 

  11. A. Hospodor, “Mechanical access time calculation,” Advances in Information Storage Systems, vol. 6, pp. 313–336, 1995.

    Google Scholar 

  12. B. L. Worthington, G. R. Ganger, Y. N. Patt, and J. Wilkes, “On-line extraction of SCSI disk drive parameters,” in Proceedings of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, (Ottawa, Canada), pp. 146–156, ACM Press, New York, NY, May 1995.

    Google Scholar 

  13. S. C. Carson and S. Setia, “Analysis of the periodic update write policy for disk cache,” IEEE Transactions on Software Engineering, vol. 18, pp. 44–54, Jan. 1992.

    Article  Google Scholar 

  14. J. A. Solworth and C. U. Orji, “Write-only disk caches,” in Proceedings of ACM SIGMOD International Conference on Management of Data (H. Garcia-Molina and H. V. Jagadish, eds.), vol. 19, (Atlantic City, NJ), pp. 123–132, May 1990.

    Google Scholar 

  15. E. Shriver, A. Merchant, and J. Wilkes, “An analytic behavior model for disk drives with readahead caches and request reordering,” in Joint International Conference on Measurement and Modeling of Computer Systems (Sigmetrics’ 98/Performance’ 98), (Madison, WI), pp. 182–191, June 1998. Available at http://www.bell-labs.com/~shriver/.

  16. N. C. Wilhelm, “An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses,” Communications of the ACM, vol. 19, pp. 13–17, Jan. 1976.

    Article  MATH  Google Scholar 

  17. M. Hofri, “Disk scheduling: FCFS vs. SSTF revisited,” Communications of the ACM, vol. 23, pp. 645–653, Nov. 1980.

    Article  Google Scholar 

  18. T. J. Teorey and T. B. Pinkerton, “A comparative analysis of disk scheduling policies,” Communications of the ACM, vol. 15, pp. 177–184, Mar. 1972.

    Article  MATH  Google Scholar 

  19. W. Oney, “Queueing analysis of the scan policy for moving-head disks,” Journal of the ACM, vol. 22, pp. 397–412, July 1975.

    Article  MATH  MathSciNet  Google Scholar 

  20. E. G. Coffman, Jr and M. Hofri, “On the expected performance of scanning disks,” SIAM Journal on Computing, vol. 11, pp. 60–70, Feb. 1982.

    Article  MATH  MathSciNet  Google Scholar 

  21. R. Barve, E. Shriver, P. B. Gibbons, B. K. Hillyer, Y. Matias, and J. S. Vitter, “Modeling and optimizing I/O throughput of multiple disks on a bus,” in Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, vol. 27, (Atlanta, GA), pp. 83–92, May 1999. Available at http://www.bell-labs.com/~shriver/.

    Article  Google Scholar 

  22. D. Bitton and J. Gray, “Disk shadowing,” in Proceedings of the 14th International Conference on Very Large Data Bases (VLDB) (F. Bancilhon and D. J. DeWitt, eds.), (Los Angeles, CA), pp. 331–338, Aug. 1988.

    Google Scholar 

  23. S. Chen and D. Towsley, “The design and evaluation of RAID 5 and parity striping disk array architectures,” Journal of Parallel and Distributed Computing, vol. 17, pp. 58–74, Jan.–Feb. 1993.

    Article  Google Scholar 

  24. A. Kuratti and W. H. Sanders, “Performance analysis of the RAID 5 disk array,” in Proceedings of International Computer Performance and Dependability Symposium, (Erlangen, Germany), pp. 236–245, Apr. 1995.

    Google Scholar 

  25. J. Menon, “Performance of RAID5 disk arrays with read and write caching,” Distributed and Parallel Databases, vol. 2, pp. 261–293, July 1994.

    Article  Google Scholar 

  26. A. Thomasian, “RAID5 disk arrays and their performance analysis,” in Recovery in Database Management Systems (V. Kumar and M. Hsu, eds.), ch. 37, pp. 807–846, Prentice-Hall, 1998.

    Google Scholar 

  27. R. R. Muntz and J. C. Lui, “Performance analysis of disk arrays under failure,” in Proceedings of the 16th International Conference of Very Large Databases, (Brisbane, Australia), pp. 162–173, Aug. 1990.

    Google Scholar 

  28. J. Menon and D. Mattson, “Performance of disk arrays in transaction processing environments,” in Proceedings of 12th International Conference on Distributed Computing Systems, (Yokohama, Japan), pp. 302–309, IEEE Computer Society Press, Los Alamitos, CA, 1992.

    Chapter  Google Scholar 

  29. A. Thomasian and J. Menon, “RAID5 performance with distributed sparing,” IEEE Transactions on Parallel and Distributed Systems, vol. 8, pp. 640–657, June 1997.

    Article  Google Scholar 

  30. S. Chen and D. Towsley, “A performance evaluation of RAID architectures,” IEEE Transactions on Computers, vol. 45, pp. 1116–1130, Oct. 1996.

    Article  MATH  Google Scholar 

  31. C. K. Wong, “Minimizing expected head movement in one-dimensional and two-dimensional mass storage systems,” ACM Computing Surveys, vol. 12, pp. 167–178, June 1980.

    Article  Google Scholar 

  32. J. G. Kollias, Y. Manolopoulos, and C. H. Papadimitriou, “The optimum execution order of queries in linear storage,” Information Processing Letters, vol. 36, pp. 141–145, Nov. 1990.

    Article  MATH  MathSciNet  Google Scholar 

  33. A. L. Drapeau and R. H. Katz, “Striped tape arrays,” in Proceedings of the Twelfth IEEE Symposium on Mass Storage Systems, (Monterey, CA), pp. 257–265, Apr. 1993.

    Google Scholar 

  34. L. Golubchik, R. R. Muntz, and R. W. Watson, “Analysis of striping techniques in robotic storage libraries,” in Proceedings of the Fourteenth IEEE Symposium on Mass Storage Systems, (Monterey, CA), pp. 225–238, Sept. 1995.

    Google Scholar 

  35. T. Chiueh, “Performance optimization for parallel tape arrays,” in Proceedings of the 1995 International Conference on Supercomputing, (Barcelona, Spain), pp. 385–394, ACM Press, July 1995.

    Google Scholar 

  36. A. L. Chervenak, Tertiary storage: An evaluation of new applications. PhD thesis, University of California at Berkeley, Computer Science Department, Dec. 1994. Technical Report UCB/CSD 94/847.

    Google Scholar 

  37. J. Myllymaki and M. Livny, “Disk-tape joins: synchronizing disk and tape access,” in Proceedings of the 1995 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, (Ottawa, Canada), pp. 279–290, May 1995.

    Google Scholar 

  38. S. Sarawagi, “Query processing in tertiary memory databases,” in Proceedings of the 21st International Conference on Very Large Databases, (Zurich, Switzerland), pp. 585–596, Morgan Kaufmann, San Francisco, Sept. 1995.

    Google Scholar 

  39. S. Sarawagi and M. Stonebraker, “Reordering queury execution in tertiary memory databases,” in Proceedings of the 22nd International Conference on Very Large Databases, (Mumbai, India), pp. 156–167, Morgan Kaufmann, San Francisco, Sept. 1996.

    Google Scholar 

  40. S. Christodoulakis, P. Triantafillou, and F. A. Zioga, “Principles of optimally placing data in tertiary storage libraries,” in Proceedings of the 23rd International Conference on Very Large Databases, (Athens, Greece), pp. 236–245, Morgan Kaufmann, San Francisco, Aug. 1997.

    Google Scholar 

  41. T. Nemoto, M. Kitsuregawa, and M. Takagi, “Simulation studies of the cassette migration activities in a scalable tape archiver,” in Proceedings of the Fifth International Conference on Database Systems for Advanced Applications, (Melbourne, Australia), pp. 461–470, Apr. 1997.

    Google Scholar 

  42. T. Johnson, “An analytical performance model of robotic storage libraries,” Performance Evaluation, vol. 27 and 28, pp. 231–251, 1996. Proceedings of Performance96 (Lausanne, Switzerland).

    Google Scholar 

  43. O. Pentakalos, D. Menasce, M. Halem, and Y. Yesha, “Analytical performance modeling of mass storage systems,” in Proceedings of the Fourteenth IEEE Symposium on Mass Storage Systems, (Monterey, CA), Sept. 1995.

    Google Scholar 

  44. B. K. Hillyer and A. Silberschatz, “On the modeling and performance characteristics of a serpentine tape drive,” in Proceedings of the 1996 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, (Philadelphia, PA), pp. 170–179, May 23–26 1996.

    Google Scholar 

  45. B. K. Hillyer and A. Silberschatz, “Random I/O scheduling in online tertiary storage systems,” in Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, (Montreal, Canada), pp. 195–204, June 3–6 1996.

    Google Scholar 

  46. B. K. Hillyer and A. Silberschatz, “Scheduling non-contiguous tape retrievals,” in Sixth Goddard Conference on Mass Storage Systems and Technologies in cooperation with the Fifteenth IEEE Symposium on Mass Storage Systems, (College Park, MD), pp. 113–123, Mar. 1998.

    Google Scholar 

  47. T. Johnson and E. L. Miller, “Benchmarking tape system performance,” in Sixth Goddard Conference on Mass Storage Systems and Technologies in cooperation with the Fifteenth IEEE Symposium on Mass Storage Systems, pp. 95–112, Mar. 1998.

    Google Scholar 

  48. T. Johnson and E. L. Miller, “Performance measurements of tertiary storage devices,” in Proceedings of the 24th International Conference on Very Large Databases, (New York, NY), pp. 50–61, Aug. 24–27 1998.

    Google Scholar 

  49. J. Wilkes, “The Pantheon storage-system simulator,” Tech. Rep. HPL-SSP-95-14, Storage Systems Program, Hewlett-Packard Laboratories, Palo Alto, CA, Dec. 1995.

    Google Scholar 

  50. G._R. Ganger, B. L. Worthington, and Y. N. Patt, “The DiskSim simulation environment: version 1.0 reference manual,” Tech. Rep. CSE-TR-358-98, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, Feb. 1998.

    Google Scholar 

  51. M. Seltzer, P. Chen, and J. Ousterhout, “Disk scheduling revisited,” in Proceedings of Winter 1990 USENIX Conference, (Washington, DC), pp. 313–323, Jan. 1990.

    Google Scholar 

  52. D. M. Jacobson and J. Wilkes, “Disk scheduling algorithms based on rotational position,” Tech. Rep. HPL-CSP-91-7, Hewlett-Packard Laboratories, Palo Alto, CA, Mar. 1991.

    Google Scholar 

  53. B. L. Worthington, G. R. Ganger, and Y. N. Patt, “Scheduling algorithms for modern disk drives,” in Proceedings of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, (Santa Clara, CA), pp. 241–251, ACM Press, New York, NY, May 1994.

    Chapter  Google Scholar 

  54. E. Gabber and H. Korth, “Data logging: A method for efficient data updates in constantly active RAIDs,” in Proceedings of the 14th International Conference on Data Engineering, (Orlando, FL), pp. 144–153, Feb. 1998.

    Google Scholar 

  55. K. Keeton, A. Drapeau, D. Patterson, and R. H. Katz, “Storage alternatives for video service,” in Proceedings of the Thirteenth IEEE Symposium on Mass Storage Systems, (Annecy, France), pp. 100–105, IEEE Computer Society Press, June 1994.

    Google Scholar 

  56. P. Zabback, J. Riegel, and J. Menon, “The RAID configuration tool,” Research Report RJ 10055 (90552), IBM Research Division, Almaden Research Center, San Jose, CA, Nov. 1996.

    Google Scholar 

  57. L. McVoy and C. Staelin, “lmbench: Portable tools for performance analysis,” in Proceedings of Winter 1996 USENIX, (San Diego, CA), pp. 279–284, Jan. 1996. Lmbench can be found at http://bitmover.com/lmbench.

  58. “Winbench99,” 1999. Available at http://www.zdnet.com/zdbop/winbench/winbench.html.

  59. P. M. Chen and D. A. Patterson, “A new approach to I/O performance evaluation self-scaling I/O benchmarks, predicted I/O performance,” in Proceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, (Santa Clara, CA), pp. 1–12, May 1993.

    Google Scholar 

  60. P. M. Chen and D. A. Patterson, “Unix I/O performance in workstations and mainframes,” Tech. Rep. CSE-TR-200-94, Department of Computer Science and Engineering, University of Michigan, Ann Arbor, MI, Mar. 1994.

    Google Scholar 

  61. K. S. Grimsrud, “Rank disk performance analysis tool white paper,” Sept. 1997. Avaliable at http://developer.intel.com/design/ipeak/stortool/index.htm, Intel Performance Evaluation and Analysis Kit (IPEAK) white papers on Analyze Disk and Rank Disk tools.

  62. S. Akyurek and K. Salem, “Adaptive block rearrangement,” in Proceedings of the Ninth International Conference on Data Engineering, (Vienna, Austria), pp. 182–189, IEEE Computer Society Press, Apr. 1993.

    Google Scholar 

  63. S. Daniel and R. Geist, “V-SCAN: an adaptive disk scheduling algorithm,” in Proceedings of International Workshop on Computer Systems Organization, (New Orleans, LA), pp. 96–103, IEEE, Mar. 1983.

    Google Scholar 

  64. K. Bates, VAX I/O subsystems: optimizing performance. Professional Press Books, Horsham PA 19044, 1991.

    Google Scholar 

  65. R. Geist and J. Westall, “Disk scheduling in Linux,” in Proceedings of International Conference for the Measurement and Performance Evaluation of Computer Systems (CMG’ 94), (Orlando, FL), pp. 739–746, Computer Measurement Group, Dec. 1994.

    Google Scholar 

  66. R. Abbott and H. Garcia-Molina, “Scheduling real-time transactions with disk resident data,” in Proceedings of 15th International Conference on Very Large Data Bases, (Amsterdam, The Netherlands), pp. 385–396, Aug. 1989.

    Google Scholar 

  67. S. Chen, J. F. Kurose, J. A. Stankovic, and D. Towsley, “Performance evaluation of two new disk scheduling algorithms for real-time systems,” Tech. Rep. UM-CS-1990-077, Department of Computer Science, University of Massachusetts at Amherst, 1990.

    Google Scholar 

  68. S. Chen and D. Towsley, “Scheduling customers in a non-removal real-time system with an application to disk scheduling,” Real-Time Systems Journal, pp. 55–72, June 1994.

    Google Scholar 

  69. Y. Li, S.-M. Tan, Z. Chen, and R. H. Campbell, “Disk scheduling with dynamic request priorities,” tech. rep., Department of Computer Science, University of Illinois at Urbana-Champaign, IL, Aug. 1995.

    Google Scholar 

  70. M._J. Carey, R. Jauhari, and M. Livny, “Priority in DBMS resource scheduling,” in Proceedings of 15th International Conference on Very Large Data Bases, (Amsterdam, The Netherlands), pp. 397–410, 1989.

    Google Scholar 

  71. P. M. Chen and D. A. Patterson, “Maximizing performance in a striped disk array,” in Proceedings of the 17th Annual International Symposium on Computer Architecture (ISCA), pp. 322–331, May 1990.

    Google Scholar 

  72. G. A. Gibson and D. A. Patterson, “Designing disk arrays for high data reliability,” Journal Parallel and Distributed Computing, vol. 17, no. 1–2, pp. 4–27, 1993.

    Article  Google Scholar 

  73. P. M. Chen and E. K. Lee, “Striping in a RAID level 5 disk array,” tech. rep., University of Michigan, Nov. 1993.

    Google Scholar 

  74. D. A. Patterson, P. Chen, G. Gibson, and R. H. Katz, “Introduction to redundant arrays of inexpensive disks (RAID),” in Digest of Papers for 34th IEEE Computer Society International Conference (COMPCON Spring’ 89), (San Francisco, CA), pp. 112–117, Feb. 1989.

    Google Scholar 

  75. J. Wilkes, R. Golding, C. Staelin, and T. Sullivan, “The HP AutoRAID hierarchical storage system,” ACM Transactions on Computer Systems, vol. 14, pp. 108–136, Feb. 1996.

    Article  Google Scholar 

  76. J. J. Gniewek, “Evolving requirements for magnetic tape data storage systems,” in Proceedings of the Fifth NASA Goddard Conference on Mass Storages and Technologies (B. Kobler, ed.), pp. 477–491, Sept. 1996.

    Google Scholar 

  77. International Business Machines Corporation, IBM 3570 tape hardware reference manual, order number GA32-0365-01, 2 ed., Mar. 1997.

    Google Scholar 

  78. G. A. Gibson, D. F. Nagle, K. Amiri, F.W. Chang, E. Feinberg, H. Gobioff, C. Lee, B. Ozceri, E. Riedel, and D. Rochberg, “A case for network-attached secure disks,” Tech. Rep. CMU-CS-96-142, Carnegie-Mellon University, June 1996.

    Google Scholar 

  79. G. A. Gibson, D. F. Nagle, K. Amiri, F. W. Chang, E. M. Feinberg, H. Gobioff, C. Lee, B. Ozceri, E. Riedel, D. Rochberg, and J. Zelenka, “File server scaling with network-attached secure disks,” in Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems (Sigmetrics’ 97), vol. 25, (Seattle, WA), pp. 272–284, June 1997.

    Article  Google Scholar 

  80. G. A. Gibson, D. F. Nagle, K. Amiri, J. Butler, F. W. Chang, H. Gobioff, C. Hardin, E. Riedel, D. Rochberg, and J. Zelenka, “A cost-effective, high-bandwidth storage architecture,” in Proceedings of the 8th Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS VIII), (San Jose, CA), Oct. 1998.

    Google Scholar 

  81. “Mission of the NASD project.” http://www.nsic.org/nasd/goals.html, Jan. 1997.

  82. M. K. McKusick, W. N. Joy, S. J. Leffler, and R. S. Fabry, “A fast file system for UNIX,” ACM Transactions on Computer Systems, vol. 2, pp. 181–197, Aug. 1984.

    Article  Google Scholar 

  83. J. K. Ousterhout, H. Da Costa, D. Harrison, J. A. Kunze, M. Kupfer, and J. G. Thompson, “A trace-driven analysis of the UNIX 4.2 BSD file system,” in Proceedings of 10th ACM Symposium on Operating Systems Principles, vol. 19, (Orcas Island, WA), pp. 15–24, ACM Press, Dec. 1985.

    Article  Google Scholar 

  84. G. R. Ganger, “Generating representative synthetic workloads: An unsolved problem,” in Proceedings of the Computer Measurement Group (CMG) Conference, (Nashville, TN), pp. 1263–1269, Dec. 1995.

    Google Scholar 

  85. E. Borowsky, R. Golding, A. Merchant, L. Schreier, E. Shriver, M. Spasojevic, and J. Wilkes, “Using attribute-managed storage to achieve QoS,” in Building QoS into distributed systems (A. Campbell and K. Nahrstedt, eds.), (Columbia University, NY, NY), pp. 203–206, June 1997. Available at http://www.bell-labs.com/~shriver/.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Shriver, E., Hillyer, B.K., Silberschatz, A. (2000). Performance Analysis of Storage Systems. In: Haring, G., Lindemann, C., Reiser, M. (eds) Performance Evaluation: Origins and Directions. Lecture Notes in Computer Science, vol 1769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46506-5_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-46506-5_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67193-0

  • Online ISBN: 978-3-540-46506-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics