서브메뉴
검색
Towards High Performance Abstractions for Strong Geo-Replicated Systems
Towards High Performance Abstractions for Strong Geo-Replicated Systems
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211150940
- ISBN
- 9798382841342
- DDC
- 004
- 저자명
- Burke, Matthew.
- 서명/저자
- Towards High Performance Abstractions for Strong Geo-Replicated Systems
- 발행사항
- [Sl] : Cornell University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 198 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 85-12, Section: B.
- 주기사항
- Advisor: Alvisi, Lorenzo.
- 학위논문주기
- Thesis (Ph.D.)--Cornell University, 2024.
- 초록/해제
- 요약Large-scale Internet applications have become ubiquitous in everyday life because they seamlessly and persistently connect people to each other and to service providers. These applications are built on geo-replicated services that reliably process and store user data. Application developers prefer services that provide strong guarantees because they simplify the process of programming correct applications. However, existing approaches to implementing geo-replicated services that meet the high throughput and low latency requirements of large-scale Internet applications sacrifice strong guarantees or generality in the application programming interface.This dissertation argues that geo-replicated services that provide strong guarantees can meet the high throughput and low latency requirements of large-scale Internet applications without sacrificing generality in the API. To do so, we propose that services more effectively leverage semantic information already present in existing, general APIs.We demonstrate this approach in the design of two systems, Morty and Gryff. Morty is a replicated transactional storage system that provides serializable transactions with high throughput under contention in geo-replicated settings. Morty achieves higher throughput than existing systems by leveraging a continuation passing style API-which is already commonly used in networked services-to implement transaction re-execution. Gryff is a replicated coordination service that provides linearizability with low read tail latency in geo-replicated settings. Gryff achieves lower read tail latency than existing systems by processing simple reads and writes with a shared register protocol instead of consensus. Because coordination services already differentiate between reads and writes and stronger synchronization operations like read-modify-writes, developers can leverage Gryff's more efficient design to provide lower latency to end-users without significantly rewriting their applications.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 키워드
- High throughput
- 키워드
- Replication
- 키워드
- Strong semantics
- 키워드
- Transactions
- 기타저자
- Cornell University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 85-12B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017160239
■00520250211150940
■006m o d
■007cr#unu||||||||
■020 ▼a9798382841342
■035 ▼a(MiAaPQ)AAI30991750
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aBurke, Matthew.▼0(orcid)0000-0002-6142-5534
■24510▼aTowards High Performance Abstractions for Strong Geo-Replicated Systems
■260 ▼a[Sl]▼bCornell University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a198 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 85-12, Section: B.
■500 ▼aAdvisor: Alvisi, Lorenzo.
■5021 ▼aThesis (Ph.D.)--Cornell University, 2024.
■520 ▼aLarge-scale Internet applications have become ubiquitous in everyday life because they seamlessly and persistently connect people to each other and to service providers. These applications are built on geo-replicated services that reliably process and store user data. Application developers prefer services that provide strong guarantees because they simplify the process of programming correct applications. However, existing approaches to implementing geo-replicated services that meet the high throughput and low latency requirements of large-scale Internet applications sacrifice strong guarantees or generality in the application programming interface.This dissertation argues that geo-replicated services that provide strong guarantees can meet the high throughput and low latency requirements of large-scale Internet applications without sacrificing generality in the API. To do so, we propose that services more effectively leverage semantic information already present in existing, general APIs.We demonstrate this approach in the design of two systems, Morty and Gryff. Morty is a replicated transactional storage system that provides serializable transactions with high throughput under contention in geo-replicated settings. Morty achieves higher throughput than existing systems by leveraging a continuation passing style API-which is already commonly used in networked services-to implement transaction re-execution. Gryff is a replicated coordination service that provides linearizability with low read tail latency in geo-replicated settings. Gryff achieves lower read tail latency than existing systems by processing simple reads and writes with a shared register protocol instead of consensus. Because coordination services already differentiate between reads and writes and stronger synchronization operations like read-modify-writes, developers can leverage Gryff's more efficient design to provide lower latency to end-users without significantly rewriting their applications.
■590 ▼aSchool code: 0058.
■650 4▼aComputer science
■650 4▼aComputer engineering
■653 ▼aDistributed systems
■653 ▼aHigh throughput
■653 ▼aReplication
■653 ▼aStrong consistency
■653 ▼aStrong semantics
■653 ▼aTransactions
■690 ▼a0984
■690 ▼a0464
■71020▼aCornell University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g85-12B.
■790 ▼a0058
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17160239▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
