메뉴 건너뛰기




Volumn 39, Issue 11, 2004, Pages 48-58

FAB: Building distributed enterprise disk arrays from commodity components

Author keywords

Consensus; Disk array; Erasure coding; Replication; Storage; Voting

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; INFORMATION SCIENCE; INTERFACES (COMPUTER); PROBLEM SOLVING; SERVERS;

EID: 12344297825     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/1037187.1024400     Document Type: Conference Paper
Times cited : (35)

References (35)
  • 2
    • 4544228284 scopus 로고    scopus 로고
    • Strict linearizability and the power of aborting
    • HPL-2003-241, HP Labs, December
    • Marcos K. Aguilera and Svend Frølund. Strict linearizability and the power of aborting. Technical Report HPL-2003-241, HP Labs, December 2003.
    • (2003) Technical Report
    • Aguilera, M.K.1    Frølund, S.2
  • 5
    • 0029215351 scopus 로고
    • Sharing memory robustly in message-passing systems
    • Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM (JACM), 42(1):124-142, 1995.
    • (1995) Journal of the ACM (JACM) , vol.42 , Issue.1 , pp. 124-142
    • Attiya, H.1    Bar-Noy, A.2    Dolev, D.3
  • 8
    • 0003548232 scopus 로고
    • Agreeing on processor group membership in asynchronous distributed systems
    • UC San Diego
    • Flaviu Christian and Frank Schmuck. Agreeing on processor group membership in asynchronous distributed systems. Technical Report CSE95-428, UC San Diego, 1995.
    • (1995) Technical Report , vol.CSE95-428
    • Christian, F.1    Schmuck, F.2
  • 12
    • 4544386478 scopus 로고    scopus 로고
    • Self-* storage: Brick-based storage with automated administration
    • Carnegie Mellon University, August
    • Gregory R. Ganger, John D. Strunk, and Andrew J. Klosterman. Self-* storage: Brick-based storage with automated administration. Technical Report CMU-CS-03-178, Carnegie Mellon University, August 2003.
    • (2003) Technical Report , vol.CMU-CS-03-178
    • Ganger, G.R.1    Strunk, J.D.2    Klosterman, A.J.3
  • 14
    • 0018684956 scopus 로고
    • Weighted voting for replicated data
    • Pacific Grove, CA, USA, December
    • David Gifford. Weighted voting for replicated data. In 7th Symp. on Op. Sys. Principles (SOSP), pages 150-162, Pacific Grove, CA, USA, December 1979.
    • (1979) 7th Symp. on Op. Sys. Principles (SOSP) , pp. 150-162
    • Gifford, D.1
  • 16
    • 4544290118 scopus 로고    scopus 로고
    • Efficient consistency for erasure-coded data via versioning servers
    • Carnegie Mellon University, April
    • Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger, and Michael K. Reiter. Efficient consistency for erasure-coded data via versioning servers. Technical Report CMU-CS-03-127, Carnegie Mellon University, April 2003.
    • (2003) Technical Report , vol.CMU-CS-03-127
    • Goodson, G.R.1    Wylie, J.J.2    Ganger, G.R.3    Reiter, M.K.4
  • 17
    • 0025460579 scopus 로고
    • Linearizability: A correctness condition for concurrent objects
    • July
    • Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. on Prog. Lang. and Sys. (TOPLAS), 12(3):463-492, July 1990.
    • (1990) ACM Trans. on Prog. Lang. and Sys. (TOPLAS) , vol.12 , Issue.3 , pp. 463-492
    • Herlihy, M.P.1    Wing, J.M.2
  • 20
    • 0032058184 scopus 로고    scopus 로고
    • The part-time parliament
    • Leslie Lamport. The part-time parliament. ACM Trans. on Comp. Sys. (TOCS), 16(2): 133-169, 1998.
    • (1998) ACM Trans. on Comp. Sys. (TOCS) , vol.16 , Issue.2 , pp. 133-169
    • Lamport, L.1
  • 21
    • 1242321054 scopus 로고    scopus 로고
    • Paxos made simple
    • December
    • Leslie Lamport. Paxos made simple. ACM SIGACT News, 32(4): 18-25, December 2001.
    • (2001) ACM SIGACT News , vol.32 , Issue.4 , pp. 18-25
    • Lamport, L.1
  • 23
    • 12344317169 scopus 로고    scopus 로고
    • LeftHand Networks. IP-based storage area networks. http://www.lefthandnetworks.com/downloads/ip-san_wp.pdf, 2002.
    • (2002) IP-based Storage Area Networks
  • 25
    • 84976685665 scopus 로고
    • Efficient at-most-once messages based on synchronized clocks
    • Barbara Liskov, Liuba Shrira, and John Wroclawski. Efficient at-most-once messages based on synchronized clocks. ACM Trans. on Comp. Sys. (TOCS), 9(2): 125-142, 1991.
    • (1991) ACM Trans. on Comp. Sys. (TOCS) , vol.9 , Issue.2 , pp. 125-142
    • Liskov, B.1    Shrira, L.2    Wroclawski, J.3
  • 26
    • 0030684623 scopus 로고    scopus 로고
    • Dynamic voting for consistent primary components
    • Santa Barbara, CA, USA, August
    • Esti Yeger Lotem, Idit Keidar, and Danny Dolev. Dynamic voting for consistent primary components. In 16th Symp. on Princ. of Distr. Comp. (PODC), pages 63-71, Santa Barbara, CA, USA, August 1997.
    • (1997) 16th Symp. on Princ. of Distr. Comp. (PODC) , pp. 63-71
    • Lotem, E.Y.1    Keidar, I.2    Dolev, D.3
  • 27
    • 84947256658 scopus 로고    scopus 로고
    • RAMBO: A reconfigurable atomic memory service for dynamic networks
    • Toulouse, France, October
    • Nancy A. Lynch and Alex A. Shvartsman. RAMBO: A reconfigurable atomic memory service for dynamic networks. In 16th Int. Conf. on Dist. Computing (DISC), pages 173-190, Toulouse, France, October 2002.
    • (2002) 16th Int. Conf. on Dist. Computing (DISC) , pp. 173-190
    • Lynch, N.A.1    Shvartsman, A.A.2
  • 28
    • 84937963100 scopus 로고
    • Improved algorithms for synchronizing computer network clocks
    • London, United Kingdom, September
    • David L. Mills. Improved algorithms for synchronizing computer network clocks. In ACM SIGCOMM, pages 317-327, London, United Kingdom, September 1994.
    • (1994) ACM SIGCOMM , pp. 317-327
    • Mills, D.L.1
  • 29
    • 84885903862 scopus 로고
    • Viewstamped replication: A new primary copy method to support highly available distrbuted systems
    • Toronto, ON, Canada, August
    • Brian Oki and Barbara Liskov. Viewstamped replication: A new primary copy method to support highly available distrbuted systems. In 7th Symp. on Princ. of Distr. Comp. (PODC), pages 8-17, Toronto, ON, Canada, August 1988.
    • (1988) 7th Symp. on Princ. of Distr. Comp. (PODC) , pp. 8-17
    • Oki, B.1    Liskov, B.2
  • 30
    • 0031223146 scopus 로고    scopus 로고
    • A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
    • James S. Plank. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems, Software - Practice and Experience, 27(9):995-1012, 1997.
    • (1997) Software - Practice and Experience , vol.27 , Issue.9 , pp. 995-1012
    • Plank, J.S.1
  • 34
    • 85017201891 scopus 로고
    • Lottery scheduling: Flexible propotional-share resource management
    • Monterey, CA, USA, November
    • Carl A. Waldspurger and William E. Weihl. Lottery scheduling: Flexible propotional-share resource management. In 1st Symp. on Op. Sys. Design and Impl. (OSDI), pages 1-11, Monterey, CA, USA, November 1994.
    • (1994) 1st Symp. on Op. Sys. Design and Impl. (OSDI) , pp. 1-11
    • Waldspurger, C.A.1    Weihl, W.E.2
  • 35
    • 0008276733 scopus 로고    scopus 로고
    • Quorum systems in replicated databases: Science or fiction?
    • December
    • Avishai Wool. Quorum systems in replicated databases: science or fiction? Bull. IEEE Technical Committee on Data Engineering, 21(4):3-11, December 1998.
    • (1998) Bull. IEEE Technical Committee on Data Engineering , vol.21 , Issue.4 , pp. 3-11
    • Wool, A.1


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