Stronger Abstractions and Performance Guarantees for Building Strongly Consistent Distributed Services- [electronic resource]
Stronger Abstractions and Performance Guarantees for Building Strongly Consistent Distributed Services- [electronic resource]
- 자료유형
- 학위논문파일 국외
- 최종처리일시
- 20240214100454
- ISBN
- 9798379717896
- DDC
- 004
- 서명/저자
- Stronger Abstractions and Performance Guarantees for Building Strongly Consistent Distributed Services - [electronic resource]
- 발행사항
- [S.l.]: : Princeton University., 2023
- 발행사항
- Ann Arbor : : ProQuest Dissertations & Theses,, 2023
- 형태사항
- 1 online resource(111 p.)
- 주기사항
- Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
- 주기사항
- Advisor: Lloyd, Wyatt Andrew;Katz-Bassett, Ethan Benjamin.
- 학위논문주기
- Thesis (Ph.D.)--Princeton University, 2023.
- 사용제한주기
- This item must not be sold to any third party vendors.
- 초록/해제
- 요약Strongly consistent distributed services require complex coordination among the services' machines. Building these services thus requires designing and reasoning about complex coordination. To make building strongly consistent distributed services easier, designers build services atop abstractions that simplify reasoning about the service. Two abstractions used today are the multi-sequence abstraction and replicated state machines.The multi-sequence abstraction simplifies ordering operations on sharded data; it explicitly orders the operations on each shard it accesses. Existing implementations have two shortcomings: failures can result in some multi-sequence numbers never being assigned, exposing a noncontiguous multi-sequence, which requires designing and implementing complex coordination in the form of consensus to handle, and existing implementations do not scale.The replicated state machine (RSM) abstraction is used by many of today's services to ensure correctness and resilience despite failures. It provides the abstraction of "a single machine that does not fail." However, with RSM protocols used today, an individual slow replica can slow the entire RSM. RSMs are commonly geo-distributed, but current state- of-the-art protocols that provide the stronger slowdown-tolerant abstraction do not have comparable latency to the state-of-practice in a wide-area network or are unable to handle certain types of slowdowns.This dissertation shows that it is possible to build systems that strengthen both abstractions while providing performance guarantees.First, we posit that sequencers should expose our new contiguous multi-sequence abstraction. Contiguity guarantees every sequence number is assigned an operation, simplifying and strengthening the abstraction. Without scalability in the implementation of the contiguous multi-sequence, a service would need to be redesigned once it has outgrown the implementation. We design and implement MASON, the first system to expose the contiguous multi-sequence abstraction and the first to provide a scalable multi-sequence. MASON is thus an ideal building block for consistent, scalable services. Our evaluation shows MASON unlocks scalable throughput for two strongly consistent services built on it.Second, we seek to provide the stronger RSM abstraction of "a single machine that does not slow down" with Avicenna, a slowdown-tolerant replicated state machine protocol that has comparable latency to the current state-of-practice in the wide-area.
- 일반주제명
- Computer science.
- 키워드
- Machines
- 기타저자
- Princeton University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 84-12B.
- 기본자료저록
- Dissertation Abstract International
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.