A fault detection mechanism in Erasure-code Byzantine Fault-tolerance Quorum
暂无分享,去创建一个
[1] Michael K. Reiter,et al. Dynamic byzantine quorum systems , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.
[2] Michael K. Reiter,et al. Byzantine quorum systems , 1997, STOC '97.
[3] Rida A. Bazzi. Synchronous Byzantine quorum systems , 2000, Distributed Computing.
[4] Arif Merchant,et al. FAB: building distributed enterprise disk arrays from commodity components , 2004, ASPLOS XI.
[5] Noam Rinetzky,et al. Towards an object store , 2003, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings..
[6] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[7] Gregory R. Ganger,et al. Object-based storage , 2003, IEEE Commun. Mag..
[8] Marcos K. Aguilera,et al. Using erasure codes efficiently for storage in a distributed system , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).
[9] Michael Dahlin,et al. Small byzantine quorum systems , 2002, Proceedings International Conference on Dependable Systems and Networks.
[10] Paul Damian Wells. A universal intermediate representation for massively parallel software development , 2004, SIGP.
[11] James Lee Hafner,et al. HoVer Erasure Codes For Disk Arrays , 2006, International Conference on Dependable Systems and Networks (DSN'06).