Skip to main content
SpringerLink
Log in

Data Allocation and Scheduling in Disks and Disk Arrays

  • Conference paper
Performance Tools and Applications to Networked Systems (MASCOTS 2003)

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

Abstract

Magnetic disks, which together with disk arrays constitute a multibillion dollar industry, were developed in 1950s. Disks were an advance over magnetic drums, which had a dedicated read/write head per track, since much higher amounts of data could be accessed in a cost effective manner due to the sharability of the movable read/write heads. DRAM memories, which are volatile, were projected to replace disks a decade ago (see Section 2.4 in [33]). This did not materialize due to the inherent volatility of DRAM, i.e., a power source is required to ensure that DRAM contents are not lost, but also due to recent dramatic increases in areal recording density and hence disk capacity, which is estimated at 60% compound annual growth rate – CAGR. This has resulted in a rapid decrease in cost per megabyte of disk capacity, so that it is lower than DRAM by a factor of 1000 to one.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Akyurek, S., Salem, K.: Adaptive block rearrangement. ACM Trans. Computers 13(2), 89–121 (1995)

    Article  Google Scholar 

  2. Alvarez, G.A., Burkhard, W.A., Cristian, F.: Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering. In: Proc. 24th Int’l Symp. Comp. Architecture, pp. 62–72 (1997)

    Google Scholar 

  3. Alvarez, G.A., Burkhard, W.A., Stockmeyer, L., Cristian, F.: Declustered disk array architectures with optimal and near-optimal parallelism. In: Proc. 25th Int’l Symp. Computer Architecture, pp. 109–120 (1998)

    Google Scholar 

  4. Alvarez, G.A., et al.: Minerva: an automated resource provisioning tool for largescale storage systems. ACM Trans. Computer Systems 19(4), 483–518 (2001)

    Article  Google Scholar 

  5. Anderson, E., et al.: Ergastulum: quickly finding near-optimal storage system designs, Technical Report HPL-SSP-2001-05, HP Labs (2001)

    Google Scholar 

  6. Anderson, E., Hobbs, M., Keeton, K., Spence, S., Uysal, M., Veitch, A.C.: Hyppodrome Running circles around storage administration. In: Proc. File and Storage Technologies Conf. - FAST 2002, pp. 175–188. USENIX (2002)

    Google Scholar 

  7. Anderson, E., Swamitham, R., Veitch, A.C., Alvarez, G.A., Wilkes, J.: Selecting RAID levels for disk arrays. In: Proc. File and Storage Technologies Conf. FAST 2002, pp. 189–201. USENIX (2002)

    Google Scholar 

  8. Bachmat, E., Schindler, J.: Analysis of methods for scheduling low priority disk drive tasks. In: Proc. ACM SIGMETRICS Conf., pp. 55–65 (2002)

    Google Scholar 

  9. Balafoutis, E., et al.: Clustered scheduling algorithms for mixed media disk workloads in a multimedia server. Cluster Computing 6(1), 75–86 (2003)

    Article  Google Scholar 

  10. Bennett, B.T., Franaszek, P.A.: Permutation clustering: An approach to online storage reorganization. IBM J. Research and Development 21(6), 528–533 (1977)

    Article  MATH  Google Scholar 

  11. Bitton, D., Gray, J.: Disk shadowing. In: Proc. 14th Int’l Very Large Database Conf., pp. 331–338 (1988)

    Google Scholar 

  12. Blaum, M., Brady, J., Bruck, J., Menon, J.: EVENODD: An optimal scheme for tolerating disk failure in RAID architectures. IEEE Trans. Computers 44(2), 192–202 (1995)

    Article  MATH  Google Scholar 

  13. Boxma, O.J., Cohen, J.W.: The M/G/1 queue with permanent customers. IEEE J. Selected Topics in Communications 9(2), 179–184 (1991)

    Article  Google Scholar 

  14. Bucy, J.S., Ganger, G.R., Contributors: The DiskSim Simulation Environment: Version 3.0 Reference Manual, Technical Report CMU-CS-03-102 (January 2003)

    Google Scholar 

  15. Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  16. Chandy, J., Narasimha Reddy, A.L.: Failure evaluation of disk array organizations. In: Proc. 13th Int’l Conf. Distributed Computing Systems - ICDCS, pp. 319–326 (1993)

    Google Scholar 

  17. Chen, P.M., Patterson, D.A.: Maximizing performance on a striped disk array. In: Proc. 17th Int’l Symp. Computer Architecture, pp. 322–331 (1990)

    Google Scholar 

  18. Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A.: RAID: High-performance, reliable secondary storage. ACM Computing Surveys 26(2), 145–185 (1994)

    Article  Google Scholar 

  19. Chen, S.-Z., Towsley, D.F.: The design and evaluation of RAID5 and parity striping disk array architectures. J. Parallel and Distributed Computing 10(1/2), 41–57 (1993)

    Google Scholar 

  20. Chen, S.-Z., Towsley, D.F.: A performance evaluation of RAID architectures. IEEE Trans. Computers 45(10), 1116–1130 (1996)

    Article  MATH  Google Scholar 

  21. Chien, C.: Seek distances in disks with dual arms and mirrored disks. Performance Evaluation 18, 175–188 (1993)

    Article  Google Scholar 

  22. Coffman Jr., E.G., Denning, P.J.: Operating Systems Theory. Prentice-Hall, Englewood Cliffs (1972)

    Google Scholar 

  23. Coffman Jr., E.G., Klimko, E.G., Ryan, B.: Analyzing of scanning policies for reducing disk seek times. SIAM J. Computing 1(3), 269–279 (1972)

    Article  MATH  Google Scholar 

  24. Coffman Jr., E.G., Hofri, M.: On the expected performance of scanning disks. SIAM J. Computing 11(1), 60–70 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  25. Coffman Jr., E.G., Hofri, M.: Queueing models of secondary storage devices. In: Takagi, H. (ed.) Stochastic Analysis of Computer and Communication Systems, pp. 549–588. North-Holland, Amsterdam (1990)

    Google Scholar 

  26. Copeland, G., Alexander, W., Boughter, E., Keller, T.: Data placement in Bubba. In: Proc. ACM SIGMOD Int’l Conf., pp. 99–108 (1988)

    Google Scholar 

  27. Courtright II, W.V., et al.: RAIDframe: A Rapid Prototyping Tool for Raid Systems, http://www.pdl.cmu.edu/RAIDframe/raidframebook.pdf

  28. Denning, P.J.: Effects of scheduling in file memory operations. In: Proc. AFIPS Spring Joint Computer Conf., pp. 9–21 (1967)

    Google Scholar 

  29. Disksim, http://www.pdl.cmu.edu/DiskSim/

  30. Diskspecs, http://www.pdl.cmu.edu/Dixtrac/index.html

  31. Geist, R.M., Daniel, S.: A continuum of disk scheduling algorithm. ACM Trans. Computer Systems 5(1), 77–92 (1987)

    Article  Google Scholar 

  32. Gelenbe, E., Mitrani, I.: Analysis and Synthesis of Computer Systems. Academic Press, London (1980)

    MATH  Google Scholar 

  33. Gibson, G.A.: Redundant Disk Arrays: Reliable, Parallel Secondary Storage. The MIT Press, Cambridge (1992)

    Google Scholar 

  34. Gibson, G.A., et al.: A cost-effective, high bandwidth storage architecture. In: Proc. ASPLOS VIII, pp. 92–103 (1998)

    Google Scholar 

  35. Gibson, G.A., van Meter, R.: Network attached storage architecture. Comm. ACM 43(11), 37–45 (2000)

    Article  Google Scholar 

  36. Gravey, A.: A simple construction of an upper bound for the mean of the maximum of N identically distributed random variables. J. Applied Probability 22, 844–851 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  37. Gray, J., Horst, B., Walker, M.: Parity striping of disk arrays: Low-cost reliable storage with acceptable throughput. In: Proc. 16th Int’l Very Large Database Conf., pp. 148–161 (1990)

    Google Scholar 

  38. Gray, J., Graefe, G.: The five-minute rule ten years later, and other computer storage rules of thumb. ACM SIGMOD Record 26(4), 63–68 (1997)

    Article  Google Scholar 

  39. Gray, J., Shenoy, P.J.: Rules of thumb in data engineering. In: Proc. 16th ICDE, pp. 3–16 (2000)

    Google Scholar 

  40. Gray, J.: Storage bricks have arrived. In: 1st Conf. on File and Storage Technologies - FAST 2002, USENIX (2002) (Keynote Speech)

    Google Scholar 

  41. Griffin, J.L., Shlosser, S.W., Ganger, G.R., Nagle, D.F.: Modeling and performance of MEMS-based storage devices. In: Proc. ACM SIGMETRICS Conf., pp. 56–65 (2000)

    Google Scholar 

  42. National Energy Research Scientific Computing Center. Global Unified Parallel File System Project - GUPFS, http://www.nersc.gov/projects/gupfs

  43. Hall Jr., M.: Combinatorial Theory, 2nd edn. John Wiley, Chichester (1986)

    MATH  Google Scholar 

  44. Han, C., Thomasian, A.: Performance of two-disk failure tolerant disk arrays. In: Proc. Symp. Performance Evaluation of Computer and Telecomm. Systems - SPECTS 2003 (2003)

    Google Scholar 

  45. Han, C., Thomasian, A., Fu, G.: How much more costly is it to tolerate two disk failures? (October 2003) (submitted for publication)

    Google Scholar 

  46. Hofri, M.: Should the two-headed disk be greedy? - Yes it should. Information Processing Letters - IPL 16(2), 83–85 (1983)

    Article  MathSciNet  Google Scholar 

  47. Holland, M.C., Gibson, G.A., Siewiorek, D.P.: Architectures and algorithms for on-line failure recovery in redundant disk arrays. Distributed and Parallel Databases 11(3), 295–335 (1994)

    Article  Google Scholar 

  48. Hou, R.Y., Menon, J.M., Patt, Y.N.: Balancing I/O response time and disk rebuild time in a RAID5 disk array. In: Proc. 26th Hawaii Int’l Conf. on System Sciences - HICSS, vol. I, pp. 70–79 (1993)

    Google Scholar 

  49. Hsiao, H.-I., DeWitt, D.J.: A performance study of three high availability data replication strategies. J. Distributed and Parallel Databases 1(1), 53–80 (1993)

    Article  Google Scholar 

  50. Hsu, W.W., Smith, A.J., Young, H.: I/O reference behavior of production database workloads and the TPC benchmarks - an analysis at the logical level. ACM Trans. Database Systems 26(1), 96–143 (2001)

    Article  MATH  Google Scholar 

  51. Hsu, W.W., Young, H., Smith, A.J.: Characteristics of production database workloads and the TPC benchmarks. IBM Systems J. 40(3), 781–802 (2001)

    Article  Google Scholar 

  52. Iyer, S., Druschel, P.: Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O. In: Proc. 17th Symp. Operating System Principles, pp. 117–130 (2001)

    Google Scholar 

  53. Jacobson, D., Wilkes, J.: Disk scheduling algorithms based on rotational position. HP Technical Report HPL-CSP-91-7rev (1991)

    Google Scholar 

  54. Kim, C., Agrawala, A.: Analysis of the fork-join queue. IEEE Trans. Computers 38(2), 250–255 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  55. King, R.P.: Disk arm movement in anticipation of future requests. ACM Trans. Computer Systems 8(3), 214–229 (1990)

    Article  Google Scholar 

  56. Kleinrock, L.: Queueing Systems. Theory, vol. I. Wiley-Interscience, Hoboken (1975)

    MATH  Google Scholar 

  57. Kleinrock, L.: Queueing Systems. Computer Applications, vol. II. Wiley- Interscience, New York (1976)

    MATH  Google Scholar 

  58. Kuratti, A., Sanders, W.H.: Performance analysis of the RAID5 disk array. In: Proc. Int’l Computer Performance and Dependability Symp., pp. 236–245 (1995)

    Google Scholar 

  59. Lavenberg, S.S. (ed.): Computer Performance Modeling Handbook. Academic Press, London (1983)

    MATH  Google Scholar 

  60. Lee, E.K., Thekkath, C.: Petal: Distributed virtual disks. In: Proc. ASPLOS XII, pp. 84–92 (1996)

    Google Scholar 

  61. Lee, E.K., Katz, R.H.: The performance of parity placements in disk arrays. IEEE Trans. Computers 42(6), 651–664 (1993)

    Article  Google Scholar 

  62. Lee, L., Scheuermann, P., Vingralek, R.: File assignment in parallel I/O systems with minimal variance of response time. IEEE Trans. Computers 49(2), 127–140 (2000)

    Article  Google Scholar 

  63. Litwin, W., Schwarz, T.: LH ∗ RS: A high-availability scalable distributed data structure using Reed Solomon codes. In: Proc. ACM SIGMOD Conf., pp. 237–248 (2000)

    Google Scholar 

  64. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in hard read-time environment. J. ACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  65. Lo, R.W.-M., Matloff, N.S.: Probabilistic limit on the virtual size of replicated data system. IEEE Trans. Knowledge and Data Eng. TKDE 4(1), 99–102 (1992)

    Article  Google Scholar 

  66. Lumb, C.R., Schindler, J., Ganger, G.R., Nagle, D.F.: Towards higher disk head utilization: Extracting free bandwidth from busy disk drives. In: Proc. 4th Symp. Operating System Design and Implementation USENIX, pp. 87–102 (2000)

    Google Scholar 

  67. Lynch, W.C.: Do disk arms move? Performance Evaluation Review 1(4), 3–16 (1972)

    Article  Google Scholar 

  68. Menon, J., Cortney, J.: The architecture of a fault-tolerant cached RAID controller. In: Proc. 20th Annual Int’l Symp. Computer Architecture, pp. 76–86 (1993)

    Google Scholar 

  69. Menon, J.: Performance of RAID5 disk arrays with read and write caching. Distributed and Parallel Databases 11(3), 261–293 (1994)

    Article  Google Scholar 

  70. Menon, J.: A performance comparison of RAID5 and log-structured arrays. In: Proc. 4th IEEE High Performance Distributed Computing, pp. 167–178 (1995)

    Google Scholar 

  71. Merchant, A., Yu, P.: An analytical model of reconstruction time in mirrored disks. Performance Evaluation 20(1-3), 115–129 (1994)

    Article  Google Scholar 

  72. Merchant, A., Yu, P.S.: Analytic modeling of clustered RAID with mapping based on nearly random permutation. IEEE Trans. Computers 45(3), 367–373 (1996)

    Article  MATH  Google Scholar 

  73. Meritt, S., et al.: z/OS support for IBM TotalStorage enterprise storage server. IBM Systems J. 42(2), 280–301 (2003)

    Article  Google Scholar 

  74. Mesnier, M., Ganger, G.R., Riedel, E.: Object-based storage. IEEE Communications Magazine 41(8), 84–90 (2003)

    Article  Google Scholar 

  75. Meth, K.Z., Satran, J.: Features of the iSCSI protocol. IEEE Communications Magazine 41(8), 72–75 (2003)

    Article  Google Scholar 

  76. Michiels, W., Korst, J., Aerts, J.: On the guaranteed throughput of multizone disks. IEEE Trans. Computers 52(11), 1407–1420 (2003)

    Article  Google Scholar 

  77. Muntz, R., Lui, J.C.S.: Performance analysis of disk arrays under failure. In: Proc. 16th Int’l Very Large Database Conf., pp. 162–173 (1990)

    Google Scholar 

  78. Nelson, R., Tantawi, A.: Approximate analysis of fork-join synchronization in parallel queues. IEEE Trans. Computers 37(6), 739–743 (1988)

    Article  Google Scholar 

  79. Ng, S.W.: Reliability, availability, and performance analysis of duplex disk systems. In: Hamza, M.H. (ed.) Reliability and Quality Control, pp. 5–9. Acta Press (1987)

    Google Scholar 

  80. Ng, S.W.: Improving disk performance via latency reduction. IEEE Trans. Computers 40(1), 22–30 (1991)

    Article  Google Scholar 

  81. Ng, S.W., Mattson, R.L.: Uniform parity distribution in disk arrays with multiple failures. IEEE Trans. Computers 43(4), 501–506 (1994)

    Article  Google Scholar 

  82. Ng, S.W.: Crosshatch disk array for improved reliability and performance. In: Proc. 21st Int’l Symp. Computer Architecture, pp. 255–264 (1994)

    Google Scholar 

  83. Ng, A.W.: Advances in disk technology: Performance issues. IEEE Computer 40(1), 75–81 (1998)

    Google Scholar 

  84. Orji, C., Solworth, J.A.: Doubly distorted mirrors. In: Proc. ACM SIGMOD Int’l Conf., pp. 307–316 (1993)

    Google Scholar 

  85. Orji, C., Weiss, M.A., Solworth, J.A.: Improved traditional mirrors. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, pp. 329–344. Springer, Heidelberg (1993)

    Google Scholar 

  86. Patterson, D.A., Gibson, G.A., Katz, R.H.: A case study for redundant arrays of inexpensive disks. In: Proc. ACM SIGMOD Int’l Conf., pp. 109–116 (1988)

    Google Scholar 

  87. Park, C.-I.: Efficient placement of parity and data to tolerate two disk failures in disk array systems. IEEE Trans. Parallel and Distributed Systems 6(11), 1177–1184 (1995)

    Article  Google Scholar 

  88. Plank, J.S.: A tutorial on Reed-Solomon coding for fault-tolerance in RAID like systems. Software Practice & Experience 27(9), 995–1012 (1997); also see Note: Correction to the 1997 tutorial on Reed-Solomon coding, see http://www.cs.utk.edu/~plank

    Article  Google Scholar 

  89. Polyzois, C., Bhide, A., Dias, D.M.: Disk mirroring with alternating deferred updates. In: Proc. 19th Int’l Very Large Database Conf., pp. 604–617 (1993)

    Google Scholar 

  90. Ramakrishnan, K.K., Biswas, P., Karedla, R.: Analysis of file I/O traces in commercial computing environments. In: Proc. Joint ACM SIGMETRICS/ Performance 1992 Conf., pp. 78–90 (1992)

    Google Scholar 

  91. Reddy, A.L., Wyllie, J.: Disk scheduling in multimedia I/O system. In: Proc. ACM Multimedia 1993, pp. 289–297 (1993)

    Google Scholar 

  92. Riska, A., Riedel, E., Iren, S.: Managing overload via adaptive scheduling. In: Proc. 1st Workshop on Algorithms and Architectures for Self-Managing systems (2003)

    Google Scholar 

  93. Riska, A., Riedel, E.: It’s not fair - evaluating efficient disk scheduling. In: Proc. 11th IEEE/ACM Int’l Symp. on Modeling, Analysis and Simulation of Computer Telecommunication Systems - MASCOTS 2003, pp. 288–395 (2003)

    Google Scholar 

  94. Rosenblum, M., Ousterhout, J.K.: The design and implementation of a logstructured file system. ACM Trans. Computer Systems 10(1), 26–52 (1992)

    Article  Google Scholar 

  95. Ruemmler, C., Wilkes, J.: A trace-driven analysis of disk working set sizes. Technical report HPL-OSR-93-23, HP Labs (1993)

    Google Scholar 

  96. Ruemmler, C., Wilkes, J.: An introduction to disk drive modeling. IEEE Computer 27(3), 17–28 (1994)

    Google Scholar 

  97. Salzwedel, K.A.: Algorithmic approaches for storage networks. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol. 2625, pp. 251–272. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  98. Santos, J.R., Muntz, R.R., Ribeiro-Neto, B.: Comparing random data allocation and data striping in multimedia servers. In: Proc. ACM SIGMETRICS Conf., pp. 44–55 (2000)

    Google Scholar 

  99. Sarkar, P., Uttamchandani, S., Voruganti, K.: Storage over IP: When does hardware support help? In: Proc. 2nd Conf. on File and Storage Technologies - FAST 2003, USENIX (2003)

    Google Scholar 

  100. Schindler, J., Ganger, G.R.: Automated disk drive characterization. CMU SCS Technical Report CMU-CS-99-176 (1999)

    Google Scholar 

  101. Schwarz, T.J.E., Steinberg, J., Burkhard, W.A.: Permutation development data layout (PDDL) disk array declustering. In: Proc. 5th IEEE Symp. on High Performance Computer Architecture - HPCA, pp. 214–217 (1999)

    Google Scholar 

  102. Seltzer, M.I., Chen, P.M., Ousterhout, J.K.: Disk scheduling revisited. In: Proc. 1990 USENIX Summer Technical Conf., pp. 307–326 (1990)

    Google Scholar 

  103. Shenoy, P.J., Vin, H.M.: Cello: A disk scheduling framework for next generation operating systems. In: Proc. ACM SIGMETRICS Conf., pp. 44–55 (1998)

    Google Scholar 

  104. Scheuermann, P., Weikum, G., Zabback, P.: Adaptive load balancing in disk arrays. In: Proc 4th Int’l Conf. Found. Data Organization and Algorithms - FODO 1993, pp. 345–360 (1993)

    Google Scholar 

  105. Scheuermann, P., Weikum, G., Zabback, P.: Disk cooling in parallel disk systems. IEEE Data Engineering Bulletin 17(3), 29–40 (1994)

    Google Scholar 

  106. Scheuermann, P., Weikum, G., Zabback, P.: Data partitioning and load balancing in parallel disk systems. Very Large Database J. 7(1), 48–66 (1998)

    Article  Google Scholar 

  107. Shriver, E., Merchant, A., Wilkes, J.: An analytic behavior model for disk drives with readahead caches and request reordering. In: Proc. Joint Int’l Conf. on Measurement and Modeling of Computer Systems, pp. 182–191 (1998)

    Google Scholar 

  108. Solworth, J.A., Orji, C.U.: Write-only disk caches. In: Proc. ACM SIGMOD Int’l Conf., pp. 123–132 (1990)

    Google Scholar 

  109. Solworth, J.A., Orji, C.U.: Distorted mirrors. In: Proc. 1st Int’l Conf. Parallel and Distributed Information Systems - PDIS, pp. 10–17 (1991)

    Google Scholar 

  110. Storage Performance Council, http://www.storageperformance.org

  111. Stodolsky, D., Holland, M., Courtright II, W.C., Gibson, G.A.: Parity logging disk arrays. ACM Trans. Computer Systems 12(3), 206–325 (1994)

    Article  Google Scholar 

  112. Takagi, H.: Queueing Analysis. Vacation and Priority Systems, vol. 1. North-Holland, Amsterdam (1991)

    MATH  Google Scholar 

  113. Teorey, T.J., Pinkerton, T.B.: A comparative analysis of disk scheduling policies. Comm. ACM 15(3), 177–184 (1972)

    Article  MATH  Google Scholar 

  114. Thomasian, A., Menon, J.: Performance analysis of RAID5 disk arrays with a vacationing server model. In: Proc. 10th ICDE Conf., pp. 111–119 (1994)

    Google Scholar 

  115. Thomasian, A.: Priority queueing in RAID disk arrays. IBM Research Report RC 19734 (1994)

    Google Scholar 

  116. Thomasian, A.: Rebuild options in RAID5 disk arrays. In: Proc. 7th IEEE Symp. Parallel & Distributed Systems - SPDP, pp. 511–518 (1995)

    Google Scholar 

  117. Thomasian, A.: RAID5 Disk Arrays and Their Performance Analysis. In: Kumar, V., Hsu, M. (eds.) Section 37 in Recovery in Database Management Systems, January 1998, Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  118. Thomasian, A., Menon, J.: RAID5 performance with distributed sparing. IEEE Trans. Parallel and Distributed Systems 8(6), 640–657 (1997)

    Article  Google Scholar 

  119. Thomasian, A.: RAID5 disk arrays and their performance evaluation. In: Kumar, V., Hsu, M. (eds.) Recovery Mechanisms in Database Systems, pp. 807–846

    Google Scholar 

  120. Thomasian, A., Fu, G., Han, C.: Rebuild strategies for redundant disk arrays. In: Proc. 21st NASA/IEEE Conf. on Mass Storage Systems and Technologies (April 2004)

    Google Scholar 

  121. Thomasian, A., Liu, C.: Some new disk scheduling policies and their performance. In: Proc. ACM SIGMETRICS Conf., pp. 266–267 (2002)

    Google Scholar 

  122. Thomasian, A., Liu, C.: Disk scheduling policies with lookahead. Performance Evaluation Review 30(2), 31–40 (2002)

    Article  Google Scholar 

  123. Thomasian, A., Liu, C.: Fairness in SPTF based scheduling, Draft (May 2003)

    Google Scholar 

  124. Thomasian, A., Liu, C.: Performance of mirrored disks with a shared NVS cache. Draft (January 2003)

    Google Scholar 

  125. Thomasian, A., Spirollari, J., Liu, C., Han, C., Fu, G.: Mirrored disk scheduling. In: Proc. Symp. Performance Evaluation of Computer and Telecomm. Systems - SPECTS 2003 (2003)

    Google Scholar 

  126. Towsley, D.F., Chen, S.-Z., Yu, S.-P.: Performance analysis of fault-tolerant mirrored disk systems. In: King, P.J.B., Mitrani, I., Pooley, R.J. (eds.) Performance 1990, pp. 239–253. North-Holland, Amsterdam (1990)

    Google Scholar 

  127. Treiber, K., Menon, J.: Simulation study of cached RAID5 designs. In: Proc. 1st IEEE Symp. on High Performance Computer Architecture - HPCA, pp. 186–197 (1995)

    Google Scholar 

  128. Trivedi, K.S.: Probability and Statistics with Reliability, Queueing and Computer Science Applications, 2nd edn. Wiley-Interscience, Hoboken (2002)

    Google Scholar 

  129. Uysal, M., Alvarez, G.A., Merchant, M.: A modular, analytical model for modern disk drives. In: Proc. 9th IEEE/ACM Int’l Symp. Modeling and Simulation of Computer and Telecommunication Systems - MASCOTS 2001, pp. 183–192 (2001)

    Google Scholar 

  130. Uysal, M., Merchant, A., Alvarez, G.A.: Using MEMS-based storage in disk arrays. In: Proc. 2nd Conf. File and Storage Technologies - FAST 2003, USENIX (2003)

    Google Scholar 

  131. Vakali, A., Manolopoulos, Y.: An exact analysis of expected seeks in shadowed disks. Information Processing Letters 61(6), 323–329 (1997)

    Article  MathSciNet  Google Scholar 

  132. Varki, E., Merchant, A., Xu, J., Qiu, X.: An integrated performance model of disk arrays. In: Proc. 11th IEEE/ACM Int’l Symp. Modeling and Simulation of Computer and Telecommunication Systems - MASCOTS 2003, pp. 296–305 (2003)

    Google Scholar 

  133. Varma, A., Jacobson, Q.: Destage algorithms for disk arrays with nonvolatile caches. IEEE Trans. Computers 47(2), 228–235 (1998)

    Article  Google Scholar 

  134. Varma, S., Makowski, A.M.: Interpolation approximations for symmetric fork-join queues. Performance Evaluation 20(1-3), 361–368 (1994)

    Article  MathSciNet  Google Scholar 

  135. Whitt, W.: Deciding which queue to join: Some counterexamples. Operation Research 34(1), 226–244 (1986)

    Article  MathSciNet  Google Scholar 

  136. Wijayaratne, R., Narasimha Reddy, A.L.: Providing QOS guarantees for disk I/O. Multimedia Systems 8, 57–68 (2000)

    Article  Google Scholar 

  137. Wilkes, J., Golding, R.A., Staelin, C., Sullivan, T.: The HP AutoRAID hierarchical storage system. ACM Trans. Computer Systems 14(1), 108–136 (1996)

    Article  Google Scholar 

  138. Wilkes, J.: The Pantheon storage-system simulator, Report HPL-SSP-95-14, HP Labs, Palo Alto, CA (May 1996) (revised)

    Google Scholar 

  139. Wilkes, J.: Data services – from data to containers (keynote speech). In: 2nd Conf. on File and Storage Technologies - FAST 2003, USENIX (2003)

    Google Scholar 

  140. Wolf, J.L.: The placement optimization program: A practical solution to the disk file assignment problem. In: Proc. ACM SIGMETRICS/Performance 1989 Int’l Conf., pp. 1–10 (1989)

    Google Scholar 

  141. Wong, C.K.: Minimizing head movement in one dimensional and two dimensional mass storage systems. ACM Computing Surveys 12(2), 167–178 (1980)

    Article  Google Scholar 

  142. Worthington, B.L., Ganger, G.R., Patt, Y.L.: Scheduling for modern disk drivers and non-random workloads. In: Proc. ACM SIGMETRICS Conf., pp. 241–251 (1994)

    Google Scholar 

  143. Wylie, J.J., et al.: Survivable information storage systems. IEEE Computer 33(8), 61–68 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, New Jersey Institute of Technology, Newark, NJ, 07102, USA

    Alexander Thomasian

Authors
  1. Alexander Thomasian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Pavia, I-27100, Pavia, Italy

    Maria Carla Calzarossa

  2. Professor in the Dennis Gabor Chair Intelligent Systems and Networks Group, Electrical and Electronic Engineering Department, Imperial College, SW7 2BT, London, UK

    Erol Gelenbe

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomasian, A. (2004). Data Allocation and Scheduling in Disks and Disk Arrays. In: Calzarossa, M.C., Gelenbe, E. (eds) Performance Tools and Applications to Networked Systems. MASCOTS 2003. Lecture Notes in Computer Science, vol 2965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24663-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24663-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21945-3

  • Online ISBN: 978-3-540-24663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation