서브메뉴
검색
Holistic Consistency Models for Faster Applications and Systems
Holistic Consistency Models for Faster Applications and Systems
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211150953
- ISBN
- 9798382191324
- DDC
- 004
- 서명/저자
- Holistic Consistency Models for Faster Applications and Systems
- 발행사항
- [Sl] : Princeton University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 170 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 85-10, Section: B.
- 주기사항
- Advisor: Lloyd, Wyatt.
- 학위논문주기
- Thesis (Ph.D.)--Princeton University, 2024.
- 초록/해제
- 요약The correctness and performance of today's applications are heavily influenced by the consistency models of their supporting services. Strong consistency models, like strict serializability and linearizability, restrict the space of possible service behaviors and in turn, simplify application programming.In exchange for their strong guarantees, however, strictly serializable and linearizable services incur worse performance than those with weaker consistency. But switching to such services can break applications. Consistency models thus offer a harsh trade-off between application correctness and service performance.Despite impacting both applications and services, most existing work on consistency models has taken a limited view. A long line of research sought to weaken the consistency of common services in an effort to improve their performance, largely without considering the impacts of weaker consistency on application correctness. A separate line of work investigated the impacts of weaker consistency on applications. In contrast, this dissertation takes a holistic approach, considering applications and services together to develop better consistency models. First, we introduce Regular Sequential Serializability (RSS) and Regular Sequential Consistency (RSC). They are respectively as strong as strict serializability and linearizability for applications: we prove any application that is correct when using a strictly serializable (respectively linearizable) service is also correct when using an RSS (RSC) service. And yet, they enable new, better-performing services, thus circumventing the correctness-performance trade-off. To demonstrate the latter, we design, implement, and evaluate variants of two systems, Spanner-RSS and Gryff-RSC. The variants achieve lower tail read latency than their existing counterparts.Second, we introduce Multi-dispatch Linearizability (MD-Linearizability), which relaxes linearizability's assumption that a client is sequential and instead explicitly allows it to issue multiple operations concurrently. This can help reduce an application's end-to-end latency. To this end, we present Ellis, the first multi-shard system to guarantee MD-Linearizability, and show it reduces end-to-end application latency by up to 75%. Importantly, we also describe how to rewrite applications built atop linearizable services into ones that interact with comparable MD-Linearizable services. Following the transformation ensures the new applications behave identically to the originals, so programmers can reap MD-Linearizability's performance benefits without worrying about breaking their applications.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 일반주제명
- Information technology
- 키워드
- Databases
- 기타저자
- Princeton University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 85-10B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017160301
■00520250211150953
■006m o d
■007cr#unu||||||||
■020 ▼a9798382191324
■035 ▼a(MiAaPQ)AAI30993332
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aHelt, Jeffrey Maxwell.
■24510▼aHolistic Consistency Models for Faster Applications and Systems
■260 ▼a[Sl]▼bPrinceton University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a170 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 85-10, Section: B.
■500 ▼aAdvisor: Lloyd, Wyatt.
■5021 ▼aThesis (Ph.D.)--Princeton University, 2024.
■520 ▼aThe correctness and performance of today's applications are heavily influenced by the consistency models of their supporting services. Strong consistency models, like strict serializability and linearizability, restrict the space of possible service behaviors and in turn, simplify application programming.In exchange for their strong guarantees, however, strictly serializable and linearizable services incur worse performance than those with weaker consistency. But switching to such services can break applications. Consistency models thus offer a harsh trade-off between application correctness and service performance.Despite impacting both applications and services, most existing work on consistency models has taken a limited view. A long line of research sought to weaken the consistency of common services in an effort to improve their performance, largely without considering the impacts of weaker consistency on application correctness. A separate line of work investigated the impacts of weaker consistency on applications. In contrast, this dissertation takes a holistic approach, considering applications and services together to develop better consistency models. First, we introduce Regular Sequential Serializability (RSS) and Regular Sequential Consistency (RSC). They are respectively as strong as strict serializability and linearizability for applications: we prove any application that is correct when using a strictly serializable (respectively linearizable) service is also correct when using an RSS (RSC) service. And yet, they enable new, better-performing services, thus circumventing the correctness-performance trade-off. To demonstrate the latter, we design, implement, and evaluate variants of two systems, Spanner-RSS and Gryff-RSC. The variants achieve lower tail read latency than their existing counterparts.Second, we introduce Multi-dispatch Linearizability (MD-Linearizability), which relaxes linearizability's assumption that a client is sequential and instead explicitly allows it to issue multiple operations concurrently. This can help reduce an application's end-to-end latency. To this end, we present Ellis, the first multi-shard system to guarantee MD-Linearizability, and show it reduces end-to-end application latency by up to 75%. Importantly, we also describe how to rewrite applications built atop linearizable services into ones that interact with comparable MD-Linearizable services. Following the transformation ensures the new applications behave identically to the originals, so programmers can reap MD-Linearizability's performance benefits without worrying about breaking their applications.
■590 ▼aSchool code: 0181.
■650 4▼aComputer science
■650 4▼aComputer engineering
■650 4▼aInformation technology
■653 ▼aConsistency models
■653 ▼aDatabases
■653 ▼aDistributed systems
■653 ▼aMulti-shard system
■653 ▼aMulti-dispatch Linearizability
■690 ▼a0984
■690 ▼a0464
■690 ▼a0489
■71020▼aPrinceton University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g85-10B.
■790 ▼a0181
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17160301▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
