The cat theorem and performance of transactional distributed systems

Shegufta Bakht Ahsan; Indranil Gupta

doi:10.1145/2955193.2955205

The cat theorem and performance of transactional distributed systems

Shegufta Bakht Ahsan, Indranil Gupta

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We argue that transactional distributed database/storage systems need to view the impossibility theorem in terms of the contention, abort rate, and throughput, rather than via the traditional CAP theorem. Motivated by Jim Gray, we state a new impossibility theorem, which we call the CAT theorem (Contention-Abort-Throughput). We present experimental results from the performance of several transactional systems w.r.t. the CAT impossibility spectrum.

Original language	English (US)
Title of host publication	Proceedings of the 4th Workshop on Distributed Cloud Computing, DCC 2016
Publisher	Association for Computing Machinery
ISBN (Print)	9781450342209
DOIs	https://doi.org/10.1145/2955193.2955205
State	Published - Jul 25 2016
Event	4th Annual ACM PODC Workshop on Distributed Cloud Computing, DCC 2016 - Chicago, United States Duration: Jul 25 2016 → Jul 28 2016

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other	4th Annual ACM PODC Workshop on Distributed Cloud Computing, DCC 2016
Country/Territory	United States
City	Chicago
Period	7/25/16 → 7/28/16

Keywords

CAP
Contention
Distributed Transaction
Throughput

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Online availability

10.1145/2955193.2955205

Library availability

Discover UIUC Full Text

Cite this

The cat theorem and performance of transactional distributed systems. / Ahsan, Shegufta Bakht; Gupta, Indranil.
Proceedings of the 4th Workshop on Distributed Cloud Computing, DCC 2016. Association for Computing Machinery, 2016. a6 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ahsan, SB & Gupta, I 2016, The cat theorem and performance of transactional distributed systems. in Proceedings of the 4th Workshop on Distributed Cloud Computing, DCC 2016., a6, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 4th Annual ACM PODC Workshop on Distributed Cloud Computing, DCC 2016, Chicago, United States, 7/25/16. https://doi.org/10.1145/2955193.2955205

@inproceedings{7ee17b5c0fdd42b3b1550a8e1e2e902e,

title = "The cat theorem and performance of transactional distributed systems",

abstract = "We argue that transactional distributed database/storage systems need to view the impossibility theorem in terms of the contention, abort rate, and throughput, rather than via the traditional CAP theorem. Motivated by Jim Gray, we state a new impossibility theorem, which we call the CAT theorem (Contention-Abort-Throughput). We present experimental results from the performance of several transactional systems w.r.t. the CAT impossibility spectrum.",

keywords = "CAP, Contention, Distributed Transaction, Throughput",

author = "Ahsan, {Shegufta Bakht} and Indranil Gupta",

note = "Publisher Copyright: {\textcopyright} 2016 ACM.; 4th Annual ACM PODC Workshop on Distributed Cloud Computing, DCC 2016 ; Conference date: 25-07-2016 Through 28-07-2016",

year = "2016",

month = jul,

day = "25",

doi = "10.1145/2955193.2955205",

language = "English (US)",

isbn = "9781450342209",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

booktitle = "Proceedings of the 4th Workshop on Distributed Cloud Computing, DCC 2016",

address = "United States",

}

TY - GEN

T1 - The cat theorem and performance of transactional distributed systems

AU - Ahsan, Shegufta Bakht

AU - Gupta, Indranil

PY - 2016/7/25

Y1 - 2016/7/25

N2 - We argue that transactional distributed database/storage systems need to view the impossibility theorem in terms of the contention, abort rate, and throughput, rather than via the traditional CAP theorem. Motivated by Jim Gray, we state a new impossibility theorem, which we call the CAT theorem (Contention-Abort-Throughput). We present experimental results from the performance of several transactional systems w.r.t. the CAT impossibility spectrum.

AB - We argue that transactional distributed database/storage systems need to view the impossibility theorem in terms of the contention, abort rate, and throughput, rather than via the traditional CAP theorem. Motivated by Jim Gray, we state a new impossibility theorem, which we call the CAT theorem (Contention-Abort-Throughput). We present experimental results from the performance of several transactional systems w.r.t. the CAT impossibility spectrum.

KW - CAP

KW - Contention

KW - Distributed Transaction

KW - Throughput

UR - http://www.scopus.com/inward/record.url?scp=85054864921&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054864921&partnerID=8YFLogxK

U2 - 10.1145/2955193.2955205

DO - 10.1145/2955193.2955205

M3 - Conference contribution

AN - SCOPUS:85054864921

SN - 9781450342209

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

BT - Proceedings of the 4th Workshop on Distributed Cloud Computing, DCC 2016

PB - Association for Computing Machinery

T2 - 4th Annual ACM PODC Workshop on Distributed Cloud Computing, DCC 2016

Y2 - 25 July 2016 through 28 July 2016

ER -

The cat theorem and performance of transactional distributed systems

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this