Niobe: A practical replication protocol

ACM Transactions on Storage

Volumn 3, Issue 4, 2008, Pages

  MacCormick, John ^a,c   Thekkath, Chandramohan A ^a   Jager, Marcus ^a   Roomp, Kristof ^a   Zhou, Lidong ^a   Peterson, Ryan ^b,d  

^a MICROSOFT RESEARCH   (United States)

^b Cornell University ^*

^c DICKINSON COLLEGE   (United States)

^d School of Operations Research and Information Engineering   (United States)

Author keywords

Enterprise storage; Replication

Indexed keywords

BUILT-IN REPLICATION; ENTERPRISE STORAGE SYSTEM; NIOBE;

DISTRIBUTED COMPUTER SYSTEMS; INTERNET; NETWORK PROTOCOLS; SPECIFICATION LANGUAGES;

DATA PROCESSING;

EID: 40749108998     PISSN: 15533077     EISSN: 15533093     Source Type: Journal    
DOI: 10.1145/1326542.1326543     Document Type: Article

References (27)

1. AGUILERA, M. AND FRØLUND, S. 2003. Strict linearizability and the power of aborting. Tech. Rep. 2003-241, Hewlett-Packard Laboratories.
2. ALSBERG, P. AND DAY, J. 1976. A principle for resilient sharing of distributed resources. In Proceedings of the 2nd International Conference on Software Engineering, 627-644.
3. BARROSO, L. A., DEAN, J., AND HOLZLE, U. 2003. Web search for a planet: The Google cluster architecture. IEEE Micro. 23, 2, 22-28.
4. BUDHIRAJA, N., MARZULLO, K., SCHNEIDER, F. B., AND TOUEG, S. 1993. The primary-backup approach. In Distributed Systems. ACM Press/Addison-Wesley.
5. BURROWS, M. 2006. The Chubby lock service for loosely-coupled distributed systems. In Proceedings of the Symposium on Operating System Design and Implementation (OSDI), 335-50.
6. CHANG, F., JI, M., LEUNG, S., MACCORMICK, J., PERL, S., AND ZHANG, L. 2002. Myriad: Cost-Effective disaster tolerance. In Proceedings of the Conference on File and Storage Technologies (FAST).
7. DOLEV, D., KEIDAR, I., AND LOTEM, E. Y. 1997. Dynamic voting for consistent primary components. In Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC). 63-71.
8. GHEMAWAT, S., GOBIOEF, H., AND LEUNG, S.-T. 2003. The Google file system. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP).
9. GRAY, C. AND CHERITON, D. 1989. Leases: An efficient fault-tolerant mechanism for distributed file cache consistency. In Proceedings of the 12th ACM Symposium on Operating Systems Principles (SOSP). 202-210.
10. HASSIN, Y. AND PELEG, D. 2006. Average probe complexity in quorum systems. J. Comput. Syst. Sci. 72, 4, 592-616.
11. HERLIHY, M. P. AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3, 463-492.
12. HSIAO, H.-I. AND DEWITT, D. 1990. Chained declustering: A new availability strategy for multiprocessor database machines. In Proceedings of the 6th International Data Engineering Conference, 456-465.
13. KISTLER, J. J. AND SATYANARAYANAN, M. 1992. Disconnected operation in the Coda file system. ACM Trans. Comput. Syst. 10, 1, 3-25.
14. LAMPORT, L. 1979. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28, 9 (Sept.), 690-91.
15. LAMPORT, L. 1998. The part-time parliament. ACM Trans. Comput. Syst. 16, 2, 133-169.
16. LAMPORT, L. 2002. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley.
17. LAMPORT, L. AND MASSA, M. 2004. Cheap paxos. In Proceedings of the International Conference on Dependable Systems and Networks (DSN), 307-314.
18. LEE, E. K. AND THEKKATH, C. A. 1996. Petal: Distributed virtual disks. In Proceedings of the Architectural Support for Programming Languages and Operating Systems (ASPLOS).
19. LISKOV, B., GHEMAWAT, S., GRUBER, R., JOHNSON, P., AND SHRIRA, L. 1991. Replication in the Harp file system. In Proceedings of the 13th ACM Symposium on Operating Systems Principles (SOSP). ACM Press, 226-238.
20. MACCORMICK, J., MURPHY, N., NAJORK, M., THEKKATH, C. A., AND ZHOU, L. 2004. Boxwood: Abstractions as the foundation for storage infrastructure. In Proceedings of the Symposium on Operating System Design and Implementation (OSDI).
21. OKI, B. M. AND LISKOV, B. H. 1988. Viewstamped replication: A new primary copy method to support highly-available distributed systems. In Proceedings of the 7th ACM Symposium on Operating Systems Principles (SOSP), 8-17.
22. PAPADIMITRIOU, C. H. 1979. The serializability of concurrent database updates. J. ACM 26, 4, 631-653.
23. PERL, S. E. AND SELTZER, M. 2006. Data management for Internet-scale single-sign-on. In Proceedings of the 3rd USENLX Workshop on Real, Large Distributed Systems (WORLDS).
24. PETERSEN, K., SPREITZER, M. J., TERRY, D. B., THEIMER, M. M., AND DEMERS, A. J. 1997. Flexible update propagation for weakly consistent replication. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP). ACM Press, New York, 288-301.
25. RISVIK, K. M., AASHEIM, Y., AND LIDAL, M. 2003. Multi-tier architecture for web search engines. In Proceedings of the 1st Latin American Web Congress (LA-WEB), Empowering Our Web. IEEE Computer Society, 132-143.
26. SAITO, Y., FRØLUND, S., VEITCH, A., MERCHANT, A., AND SPENCE, S. 2004. FAB: Building distributed enterprise disk arrays from commodity components. SIGOPS Oper. Syst. Rev. 38, 5, 48-58.
27. VAN RENESSE, R. AND SCHNEIDER, F. B. 2004. Chain replication for supporting high throughput and availability. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI).