서브메뉴
검색
Workload Adaptations for Contended Main-Memory Multicore Transactions- [electronic resource]
Workload Adaptations for Contended Main-Memory Multicore Transactions- [electronic resource]
- 자료유형
- 학위논문
- Control Number
- 0016931128
- International Standard Book Number
- 9798379604837
- Dewey Decimal Classification Number
- 004
- Main Entry-Personal Name
- Qian, William Luo.
- Publication, Distribution, etc. (Imprint
- [S.l.] : Harvard University., 2022
- Publication, Distribution, etc. (Imprint
- Ann Arbor : ProQuest Dissertations & Theses, 2022
- Physical Description
- 1 online resource(120 p.)
- General Note
- Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
- General Note
- Advisor: Kohler, Eddie.
- Dissertation Note
- Thesis (Ph.D.)--Harvard University, 2022.
- Restrictions on Access Note
- This item must not be sold to any third party vendors.
- Summary, Etc.
- 요약Database transactions guarantee atomicity for complex queries. Recent work in main-memory multicore transaction processing systems have achieved high transaction processing throughput, especially for uncontended workloads. Many systems achieve high performance by implementing new concurrency control (CC) protocols. Notably, variants of optimistic concurrency control (OCC), such as single-version concurrency control (1VCC) and multi-version concurrency control (MVCC) can perform well even under contention. In this work, I present MSTO, an MVCC system implemented to evaluate CC performance without the impact of basis factors. Experimental results show that while MVCC does outperform over 1VCC in some scenarios, 1VCC is far more resilient to collapse at high contention than previously believed. 1VCC even outperforms MVCC on many high-contention workloads. I then introduce an optimization to reduce write-write conflicts between transactions, deferred updates. In conjunction with the static timestamp splitting optimization that reduces read-write conflicts, deferred updates can be very effective at improving transactional throughput for all CC protocols, including TPC-C throughputs of 5.68x for 1VCC and 4.72x for MVCC compared to their baselines. Finally, I present and evaluate adaptive timestamp splitting, which changes each record's partitioning strategy to accommodate workloads with heterogeneous access patterns. On workloads where 1VCC with deferred updates and adaptive timestamp splitting records the highest throughput, it commits up to 3.98x as many transactions as 1VCC with deferred updates and static timestamp splitting, and up to 4.43x as many transactions as baseline 1VCC. Not all workloads benefit from adaptive timestamp splitting, as baseline MVCC records greater throughput at very high contention.
- Subject Added Entry-Topical Term
- Computer science.
- Subject Added Entry-Topical Term
- Engineering.
- Index Term-Uncontrolled
- Database transactions
- Index Term-Uncontrolled
- Transaction processing
- Index Term-Uncontrolled
- Optimistic concurrency control
- Index Term-Uncontrolled
- Timestamp splitting
- Added Entry-Corporate Name
- Harvard University Engineering and Applied Sciences - Computer Science
- Host Item Entry
- Dissertations Abstracts International. 84-12B.
- Host Item Entry
- Dissertation Abstract International
- Electronic Location and Access
- 로그인을 한후 보실 수 있는 자료입니다.
- Control Number
- joongbu:639895
detalle info
- Reserva
- 캠퍼스간 도서대출
- 서가에 없는 책 신고
- Mi carpeta