메뉴 건너뛰기




Volumn , Issue , 2005, Pages 336-345

Using erasure codes efficiently for storage in a distributed system

Author keywords

[No Author keywords available]

Indexed keywords

ERASURE CODES; NODE FAILURES; TWO-PHASE COMMITS;

EID: 27544459535     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2005.96     Document Type: Conference Paper
Times cited : (131)

References (12)
  • 1
    • 27144525311 scopus 로고    scopus 로고
    • Row-diagonal parity for double disk failure correction
    • P. Corbett et. al., "Row-diagonal parity for double disk failure correction," in Proceedings of FAST, 2004.
    • (2004) Proceedings of FAST
    • Corbett, P.1
  • 3
    • 0002653546 scopus 로고    scopus 로고
    • Oceanstore: An architecture for global-scale persistent storage
    • J. Kubiatowicz et al., "Oceanstore: An architecture for global-scale persistent storage," in Proceedings of ASPLOS, 2000.
    • (2000) Proceedings of ASPLOS
    • Kubiatowicz, J.1
  • 4
    • 34548370826 scopus 로고    scopus 로고
    • Myriad: Cost-effective disaster tolerance
    • F. Chang et al., "Myriad: Cost-effective Disaster Tolerance," in Proceedings of FAST, 2002.
    • (2002) Proceedings of FAST
    • Chang, F.1
  • 5
    • 4544294537 scopus 로고    scopus 로고
    • A decentralized algorithm for erasure-coded virtual disks
    • S. Frolund et. al., "A decentralized algorithm for erasure-coded virtual disks," in Proceedings of DSN, 2004.
    • (2004) Proceedings of DSN
    • Frolund, S.1
  • 7
    • 0036446135 scopus 로고    scopus 로고
    • Reperasure: Replication protocol using erasurecode in peer-to-peer storage
    • Z. Zhang and Q. Lian, "Reperasure: Replication protocol using erasurecode in peer-to-peer storage," in Proceedings of SRDS, 2002.
    • (2002) Proceedings of SRDS
    • Zhang, Z.1    Lian, Q.2
  • 8
    • 0041032346 scopus 로고    scopus 로고
    • LH* RS: A high-availability scalable distributed data structure using reed solomon codes
    • W. Litwin and T. Schwarz, "LH* RS: A high-availability scalable distributed data structure using reed solomon codes," in Proceedings of SIGUOD, 2000.
    • (2000) Proceedings of SIGUOD
    • Litwin, W.1    Schwarz, T.2
  • 9
    • 27544482156 scopus 로고    scopus 로고
    • Efficient fault-tolerant distributed storage using erasure codes
    • Washington University in St. Louis, Feb
    • M. K. Aguilera, R. Janakiraman, and L. Xu, "Efficient fault-tolerant distributed storage using erasure codes," Tech. Rep., Washington University in St. Louis, Feb 2004, Available at http://www.nisl.wustl.edu/ Papers/Tech/aguilera04efficient.pdf.
    • (2004) Tech. Rep.
    • Aguilera, M.K.1    Janakiraman, R.2    Xu, L.3
  • 10
    • 84976724324 scopus 로고
    • Byzantine generals in actions: Implementing fail-stop processors
    • May
    • F. Schneider, "Byzantine generals in actions: implementing fail-stop processors," ACM Transactions on Computer Systems, vol. 2, no. 2, pp. 145-154, May 1984.
    • (1984) ACM Transactions on Computer Systems , vol.2 , Issue.2 , pp. 145-154
    • Schneider, F.1
  • 11
    • 0022873767 scopus 로고
    • On interprocess communication
    • L. Lamport, "On interprocess communication," Distributed computing, vol. 1, no. 1, pp. 77-101, 1986.
    • (1986) Distributed Computing , vol.1 , Issue.1 , pp. 77-101
    • Lamport, L.1
  • 12
    • 35248864440 scopus 로고    scopus 로고
    • Multi-writer consistency conditions for shared memory objects
    • October
    • C. Shao, E. Pierce, and Jennifer L. Welch, "Multi-writer consistency conditions for shared memory objects," in Proceedings of ICDCS, October 2003, pp. 106-120.
    • (2003) Proceedings of ICDCS , pp. 106-120
    • Shao, C.1    Pierce, E.2    Welch, J.L.3


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