The cat theorem and performance of transactional distributed systems

Shegufta Bakht Ahsan, Indranil Gupta

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationProceedings of the 4th Workshop on Distributed Cloud Computing, DCC 2016
PublisherAssociation for Computing Machinery
ISBN (Print)9781450342209
DOIs
StatePublished - Jul 25 2016
Event4th Annual ACM PODC Workshop on Distributed Cloud Computing, DCC 2016 - Chicago, United States
Duration: Jul 25 2016Jul 28 2016

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other4th Annual ACM PODC Workshop on Distributed Cloud Computing, DCC 2016
CountryUnited States
CityChicago
Period7/25/167/28/16

Keywords

  • CAP
  • Contention
  • Distributed Transaction
  • Throughput

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'The cat theorem and performance of transactional distributed systems'. Together they form a unique fingerprint.

  • Cite this

    Ahsan, S. B., & 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. https://doi.org/10.1145/2955193.2955205