TARDiS

Crooks, Natacha; Pu, Youer; Estrada, Nancy Rubio; Gupta, Trinabh; Alvisi, Lorenzo; Clement, Allen

doi:10.1145/2882903.2882951

Cited by 23 publications

(3 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our idea of versioning state bears resemblance to Concurrent Revisions [Burckhardt et al 2010[Burckhardt et al , 2012, a programming abstraction that provides deterministic concurrent execution, and Tardis [Crooks et al 2016], a key-value store that also supports a branch-and-merge concurrency control abstraction. However, unlike these previous efforts which provide no principled methodology for constructing merge functions, or reasoning about their correctness, our primary contribution is in the development of a type-based compositional derivation strategy for merge operations over sophisticated inductive data types.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Mergeable replicated data types

Kaki

Priya

Sivaramakrishnan

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Programming geo-replicated distributed systems is challenging given the complexity of reasoning about different evolving states on different replicas. Existing approaches to this problem impose significant burden on application developers to consider the effect of how operations performed on one replica are witnessed and applied on others. To alleviate these challenges, we present a fundamentally different approach to programming in the presence of replicated state. Our insight is based on the use of invertible relational specifications of an inductively-defined data type as a mechanism to capture salient aspects of the data type relevant to how its different instances can be safely merged in a replicated environment. Importantly, because these specifications only address a data type's (static) structural properties, their formulation does not require exposing low-level system-level details concerning asynchrony, replication, visibility, etc. As a consequence, our framework enables the correct-by-construction synthesis of rich merge functions over arbitrarily complex (i.e., composable) data types. We show that the use of a rich relational specification language allows us to extract sufficient conditions to automatically derive merge functions that have meaningful non-trivial convergence properties. We incorporate these ideas in a tool called Quark, and demonstrate its utility via a detailed evaluation study on real-world benchmarks. CCS Concepts: • Computing methodologies → Distributed programming languages; • Computer systems organization → Availability; • Software and its engineering → Formal software verification.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

Mergeable replicated data types

Kaki

Priya

Sivaramakrishnan

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…In some distributed models, however, state changes received are stored, and conflict resolution, if any, is deferred to a later time. For example, total store ordering [Inc and Weaver 1994], global sequence protocols [Burckhardt et al 2015;Gotsman and Burckhardt 2017], TARDiS [Crooks et al 2016], Irmin [Farinier et al 2015], concurrent revisions [Burckhardt and Leijen 2011], GoT [Achar and Lopes 2019], are a few models that first store the incoming changes, and provide the programmer control over when these changes are resolved and introduced into the local state. From the point of view of the user of an interactive debugger observing reconciliation in these models, the user must both observe when information is received from a remote site, and when the information is accepted and incorporated in the local state.…”

Section: Exposing Changes Due To Reconciliation Ofmentioning

confidence: 99%

“…For example, in the global sequence protocol (GSP) model [Burckhardt et al 2015;Gotsman and Burckhardt 2017], the operations that are distributed to all remote sites are placed in an pending queue, ready to be applied through an explicit primitive given to the local application. In TARDiS [Crooks et al 2016], concurrent writes are placed under version control in separate branches to avoid interfering with each other until one context wants to introduce these concurrent changes to its branch using the resolve primitive.…”

Section: Read Stabilitymentioning

confidence: 99%

GoTcha: an interactive debugger for GoT-based distributed systems

Achar

Dawn

Lopes

2019

Proceedings of the 2019 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Sof

View full text Add to dashboard Cite

Debugging distributed systems is hard. Most of the techniques that have been developed for debugging such systems use either extensive model checking, or postmortem analysis of logs and traces. Interactive debugging is typically a tool that is only effective in single threaded and single process applications, and is rarely applied to distributed systems. While the live observation of state changes using interactive debuggers is effective, it comes with a host of problems in distributed scenarios. In this paper, we discuss the requirements an interactive debugger for distributed systems should meet, the role the underlying distributed model plays in facilitating the debugger, and the implementation of our interactive debugger: GoTcha.GoTcha is a browser based interactive debugger for distributed systems built on the Global Object Tracker (GoT) programming model. We show how the GoT model facilitates the debugger, and the features that the debugger can offer. We also demonstrate a typical debugging workflow.

show abstract