Practical Deterministic Transaction Processing with Low-cost Re-execution

Deterministic concurrency control (DCC) can guarantee consistent execution results with the same input transactions, which can reduce the synchronization overhead when applied to a multi-replica distributed database. To achieve determinism, early DCC protocols require priori knowledge about executio...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings - International Conference on Parallel and Distributed Systems pp. 487 - 495
Main Authors: Li, Xingchen, Wang, Xinyuan, Huang, Hejiao
Format: Conference Proceeding
Language:English
Published: IEEE 10.10.2024
Subjects:
Concurrency control
Costs
Degradation
Distributed Database
Distributed databases
Optimization
Parallel processing
Parallel Scheduler
Pipelines
Process control
Protocols
Synchronization
Transaction Processing
ISSN:2690-5965
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Deterministic concurrency control (DCC) can guarantee consistent execution results with the same input transactions, which can reduce the synchronization overhead when applied to a multi-replica distributed database. To achieve determinism, early DCC protocols require priori knowledge about execution details of transactions, such as read/write sets, for prescheduling. State-of-the-art DCC protocols like Aria and FGA address this impractical limitation. However, they struggle with performance degradation due to high abort rate under skewed and write-intensive workloads. In this paper, we present Dmucca, a practical DCC protocol that maintains ideal performance across varying transaction workloads without requiring any priori knowledge about them. Dmucca utilizes re-execution strategy to commit nearly all transactions after their second execution. To reduce the cost of re-execution, Dmucca incorporates a multiversion cache, inter-batch pipeline parallel processing, as well as a novel reordering schema based on weight prediction. Finally we evaluate Dmucca as well as other state-of-the-art DCC protocols with the two popular benchmarks, YCSB and TPC-C. And the experimental results show that Dmucca has the optimal performance in most scenarios.
AbstractList Deterministic concurrency control (DCC) can guarantee consistent execution results with the same input transactions, which can reduce the synchronization overhead when applied to a multi-replica distributed database. To achieve determinism, early DCC protocols require priori knowledge about execution details of transactions, such as read/write sets, for prescheduling. State-of-the-art DCC protocols like Aria and FGA address this impractical limitation. However, they struggle with performance degradation due to high abort rate under skewed and write-intensive workloads. In this paper, we present Dmucca, a practical DCC protocol that maintains ideal performance across varying transaction workloads without requiring any priori knowledge about them. Dmucca utilizes re-execution strategy to commit nearly all transactions after their second execution. To reduce the cost of re-execution, Dmucca incorporates a multiversion cache, inter-batch pipeline parallel processing, as well as a novel reordering schema based on weight prediction. Finally we evaluate Dmucca as well as other state-of-the-art DCC protocols with the two popular benchmarks, YCSB and TPC-C. And the experimental results show that Dmucca has the optimal performance in most scenarios.
Author Li, Xingchen
Huang, Hejiao
Wang, Xinyuan
Author_xml – sequence: 1
  givenname: Xingchen
  surname: Li
  fullname: Li, Xingchen
  organization: Harbin Institute of Technology,School of Computer Science and Technology,Shenzhen,China
– sequence: 2
  givenname: Xinyuan
  surname: Wang
  fullname: Wang, Xinyuan
  organization: Harbin Institute of Technology,School of Computer Science and Technology,Shenzhen,China
– sequence: 3
  givenname: Hejiao
  surname: Huang
  fullname: Huang, Hejiao
  email: huanghejiao@hit.edu.cn
  organization: Harbin Institute of Technology,School of Computer Science and Technology,Shenzhen,China
BookMark eNotT91KwzAYjaLgNvcGIn2B1i9fmqS5HJ0_hYJF5_VI41eNbK0klenb26FX5xzOD5w5O-uHnhi75pBxDuamKpvV-lkJISFDwDwDAA0nbGm0KYTgkkuj1CmboTKQTlxesHmMHwAIU2fGqiZYN3pnd8maRgp73_s46WQTbB-P1tAnTRgcxej7t-Tgx_ekHg6pG-KYPFFK3-S-jqlLdt7ZXaTlPy7Yy93tpnxI68f7qlzVqedajaluFQlEI0VRWCiwMwhkDBhQEq2lnFzupg-tK2zbaccxl07iq-XYirxDsWBXf7ueiLafwe9t-Nly0EoUXItfrTRP9g
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICPADS63350.2024.00070
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9798331515966
EISSN 2690-5965
EndPage 495
ExternalDocumentID 10763817
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i176t-7b6e32295388a082f920e99090652aae4ec4c070bc8abf7c1245c52da12b34f23
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001481011800060&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Mar 19 05:40:51 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i176t-7b6e32295388a082f920e99090652aae4ec4c070bc8abf7c1245c52da12b34f23
PageCount 9
ParticipantIDs ieee_primary_10763817
PublicationCentury 2000
PublicationDate 2024-Oct.-10
PublicationDateYYYYMMDD 2024-10-10
PublicationDate_xml – month: 10
  year: 2024
  text: 2024-Oct.-10
  day: 10
PublicationDecade 2020
PublicationTitle Proceedings - International Conference on Parallel and Distributed Systems
PublicationTitleAbbrev ICPADS
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020350
Score 2.2704496
Snippet Deterministic concurrency control (DCC) can guarantee consistent execution results with the same input transactions, which can reduce the synchronization...
SourceID ieee
SourceType Publisher
StartPage 487
SubjectTerms Concurrency control
Costs
Degradation
Distributed Database
Distributed databases
Optimization
Parallel processing
Parallel Scheduler
Pipelines
Process control
Protocols
Synchronization
Transaction Processing
Title Practical Deterministic Transaction Processing with Low-cost Re-execution
URI https://ieeexplore.ieee.org/document/10763817
WOSCitedRecordID wos001481011800060&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVoxcBUPor4lgdWgxM7sT2iFkQlVFVQpG6V7VykLg1qU-Dnc3bTloWBzfLgKBdf3p197x4ht7K0KssLzTIoDJPCcmYcZikYHDgrQRW84FFsQg2HejIxo4asHrkwABCLz-AuDONdflH5VTgqQw9Hb9CJapGWUmpN1tpmV-GKrKEAJ9zcD3qjh_5bLnAWs8A09MjmQZH4l4ZKhJCnzj8ffki6OzIeHW1h5ojswfyYdDZqDLRxzhMyWLceQpvTflPjEpsw0_FOEpw2vABciIYTWPpSfTFfLWv6Cgy-wcdt2CXvT4_j3jNrhBLYLFF5zZTLQQRdbqG1RUwvTcoBYcZgfJFaCxK89Pj2zmvrSuUR0zOfpYVNUidkmYpT0p5Xczgj1InMG-NNoQ2XUoB1DmM87ZxSrsTg6Jx0g2mmH-teGNONVS7-mL8kB8H64W-f8CvSrhcruCb7_rOeLRc38Qv-AGyDnOc
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEG0UTfSEHxi_7cFrtbvtbtujAQlEJEQx4Uba7mzChSWwqD_ftizgxYO3TQ_b7LSzb6adNw-he55rkaSZJAlkinCmKVHGZSkuODCag8hoRoPYhOj35WikBhVZPXBhACAUn8GDfwx3-Vlhl_6ozHm48wYZiV20l3AeRyu61ia_8pdkFQk4ouqx2xw8td5T5kZdHhj7LtnUaxL_UlEJINKu_3P6I9TY0vHwYAM0x2gHpieovtZjwJV7nqLuqvmQszpuVVUuoQ0zHm5FwXHFDHAvwv4MFveKL2KLRYnfgMA32LARG-ij_TxsdkgllUAmkUhLIkwKzCtzMym1Q_VcxRQc0CgXYcRaAwfLrft6Y6U2ubAO1RObxJmOYsN4HrMzVJsWUzhH2LDEKmVVJhXlnIE2xkV50hghTO7CowvU8KYZz1bdMMZrq1z-MX6HDjrD19641-2_XKFDvxL-3x_Ra1Qr50u4Qfv2s5ws5rdhNX8AxgGgLg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+-+International+Conference+on+Parallel+and+Distributed+Systems&rft.atitle=Practical+Deterministic+Transaction+Processing+with+Low-cost+Re-execution&rft.au=Li%2C+Xingchen&rft.au=Wang%2C+Xinyuan&rft.au=Huang%2C+Hejiao&rft.date=2024-10-10&rft.pub=IEEE&rft.eissn=2690-5965&rft.spage=487&rft.epage=495&rft_id=info:doi/10.1109%2FICPADS63350.2024.00070&rft.externalDocID=10763817