메뉴 건너뛰기




Volumn , Issue , 2002, Pages 189-201

Selecting RAID levels for disk arrays

Author keywords

[No Author keywords available]

Indexed keywords

ARRAY CONFIGURATIONS; AUTOMATIC DESIGN; COMPARATIVE STUDIES; CONFIGURATION PARAMETERS; PERFORMANCE REQUIREMENTS; ROBUST SOLUTIONS; SYSTEMATIC ANALYSIS; VIABLE SOLUTIONS;

EID: 85077196286     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (24)

References (27)
  • 3
    • 1542594226 scopus 로고    scopus 로고
    • Simple table-based modeling of storage devices
    • Hewlett-Packard Laboratories, July
    • E. Anderson. Simple table-based modeling of storage devices. Technical report HPL–SSP–2001–4, Hewlett-Packard Laboratories, July 2001. http://www.hpl.hp.com/SSP/papers/.
    • (2001) Technical Report HPL–SSP–2001–4
    • Anderson, E.1
  • 5
    • 4544246072 scopus 로고    scopus 로고
    • Ergastulum: An approach to solving the workload and device configuration problem
    • Hewlett-Packard Laboratories, June
    • E. Anderson, M. Kallahalla, S. Spence, R. Swaminathan, and Q. Wang. Ergastulum: An approach to solving the workload and device configuration problem. Technical report HPL–SSP–2001–5, Hewlett-Packard Laboratories, June 2001. http://www.hpl.hp.com/SSP/papers/.
    • (2001) Technical Report HPL–SSP–2001–5
    • Anderson, E.1    Kallahalla, M.2    Spence, S.3    Swaminathan, R.4    Wang, Q.5
  • 6
    • 0029254192 scopus 로고
    • Even-odd – an efficient scheme for tolerating double-disk failures in RAID architectures
    • February
    • M. Blaum, J. Brady, J. Bruck, and J. Menon. Even-odd – an efficient scheme for tolerating double-disk failures in RAID architectures. IEEE Transactions on Computers, 44(2):192–202, February 1995.
    • (1995) IEEE Transactions on Computers , vol.44 , Issue.2 , pp. 192-202
    • Blaum, M.1    Brady, J.2    Bruck, J.3    Menon, J.4
  • 10
    • 51249181640 scopus 로고
    • Bin packing can be solved within 1+ε in linear time
    • W. Fernandez de la Vega and G. Lueker. Bin packing can be solved within 1+ε in linear time. Combinatorica, 1(4):349–355, 1981.
    • (1981) Combinatorica , vol.1 , Issue.4 , pp. 349-355
    • de la Vega, W.F.1    Lueker, G.2
  • 11
    • 0028483751 scopus 로고
    • Coding techniques for handling failures in large disk arrays
    • L. Hellerstein, G. Gibson, R. Karp, R. Katz, and D. Patterson. Coding techniques for handling failures in large disk arrays. Algorithmica, 12(2/3):182–208, 1994.
    • (1994) Algorithmica , vol.12 , Issue.2-3 , pp. 182-208
    • Hellerstein, L.1    Gibson, G.2    Karp, R.3    Katz, R.4    Patterson, D.5
  • 13
    • 0003615463 scopus 로고    scopus 로고
    • Hewlett-Packard Company. December Publication A5277–90001
    • Hewlett-Packard Company. HP SureStore E Disk Array FC60—User’s guide, December 2000. Publication A5277–90001.
    • (2000) HP SureStore E Disk Array FC60—User’s Guide
  • 15
    • 0000339680 scopus 로고
    • Worst-case performance bounds for simple one-dimensional packing algorithms
    • December
    • D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3(4):299–325, December 1974.
    • (1974) SIAM Journal on Computing , vol.3 , Issue.4 , pp. 299-325
    • Johnson, D.S.1    Demers, A.2    Ullman, J.D.3    Garey, M.R.4    Graham, R.L.5
  • 16
    • 84945960950 scopus 로고    scopus 로고
    • Best-fit bin-packing with random order
    • January
    • C. Kenyon. Best-fit bin-packing with random order. In Symposium on Discrete Algorithms, pages 359–364, January 1996.
    • (1996) Symposium on Discrete Algorithms , pp. 359-364
    • Kenyon, C.1
  • 18
    • 0043001951 scopus 로고    scopus 로고
    • Technical Report HPL–2001–118, Hewlett-Packard Laboratories, April
    • A. Merchant and G. A. Alvarez. Disk array models in Minerva. Technical Report HPL–2001–118, Hewlett-Packard Laboratories, April 2001. http://www.hpl.hp.com/SSP/papers/.
    • (2001) Disk Array Models in Minerva
    • Merchant, A.1    Alvarez, G.A.2
  • 19
    • 33749040630 scopus 로고    scopus 로고
    • Striping in disk array RM2 enabling the tolerance of double disk failures
    • November
    • C.-I. Park and T.-Y. Choe. Striping in disk array RM2 enabling the tolerance of double disk failures. In Supercomputing, November 1996.
    • (1996) Supercomputing
    • Park, C.-I.1    Choe, T.-Y.2
  • 22
    • 0031677967 scopus 로고    scopus 로고
    • Overlay striping and optimal parallel I/O for modern applications
    • January
    • P. Triantafillou and C. Faloutsos. Overlay striping and optimal parallel I/O for modern applications. Parallel Computing, 24(1):21–43, January 1998.
    • (1998) Parallel Computing , vol.24 , Issue.1 , pp. 21-43
    • Triantafillou, P.1    Faloutsos, C.2
  • 25
    • 8344281265 scopus 로고    scopus 로고
    • Traveling to rome: QoS specifications for automated storage system management
    • Karlsruhe, Germany, June Springer-Verlag
    • John Wilkes. Traveling to Rome: QoS specifications for automated storage system management. In Proceedings of the International Workshop on Quality of Service (IWQoS’2001), Karlsruhe, Germany, June 2001. Springer-Verlag.
    • (2001) Proceedings of the International Workshop on Quality of Service (IWQoS’2001)
    • Wilkes, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.