Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleFebruary 2024
Distributed computing with the cloud
Distributed Computing (DICO), Volume 37, Issue 1Mar 2024, Pages 1–18https://doi.org/10.1007/s00446-024-00460-wAbstractWe investigate the effect of omnipresent cloud storage on distributed computing. To this end, we specify a network model with links of prescribed bandwidth that connect standard processing nodes, and, in addition, passive storage nodes. Each ...
- research-articleJanuary 2024
- editorialDecember 2022
- research-articleNovember 2022
-
- research-articleOctober 2022
The sum of its parts: Analysis of federated byzantine agreement systems
Distributed Computing (DICO), Volume 35, Issue 5Oct 2022, Pages 399–417https://doi.org/10.1007/s00446-022-00430-0AbstractFederated Byzantine Agreement Systems (FBASs) are a fascinating new paradigm in the context of consensus protocols. Originally proposed for powering the Stellar payment network, FBASs can instantiate Byzantine quorum systems without requiring out-...
- research-articleOctober 2022
PerformERL: a performance testing framework for erlang
Distributed Computing (DICO), Volume 35, Issue 5Oct 2022, Pages 439–454https://doi.org/10.1007/s00446-022-00429-7AbstractThe Erlang programming language is used to build concurrent, distributed, scalable and resilient systems. Every component of these systems has to be thoroughly tested not only for correctness, but also for performance. Performance analysis tools ...
- research-articleOctober 2022
- editorialAugust 2022
- research-articleJune 2022
Last-use opacity: a strong safety property for transactional memory with prerelease support
Distributed Computing (DICO), Volume 35, Issue 3Jun 2022, Pages 265–301https://doi.org/10.1007/s00446-022-00420-2AbstractTransaction Memory (TM) is a concurrency control abstraction that allows the programmer to specify blocks of code to be executed atomically as transactions. However, since transactional code can contain just about any operation attention must be ...
- research-articleApril 2022
Unbeatable consensus
Distributed Computing (DICO), Volume 35, Issue 2Apr 2022, Pages 123–143https://doi.org/10.1007/s00446-021-00417-3AbstractThe unbeatability of a consensus protocol, introduced by Halpern et al. (SIAM J Comput 31:838–865, 2001), is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledge-based analysis, this paper ...
- research-articleApril 2022
- research-articleApril 2022
Strong eventual consistency of the collaborative editing framework WOOT
Distributed Computing (DICO), Volume 35, Issue 2Apr 2022, Pages 145–164https://doi.org/10.1007/s00446-021-00414-6AbstractCommutative Replicated Data Types (CRDTs) are a promising new class of data structures for large-scale shared mutable content in applications that only require eventual consistency. The WithOut Operational Transforms (WOOT) framework is the first ...
- research-articleFebruary 2022
Dynamic scheduling in distributed transactional memory
Distributed Computing (DICO), Volume 35, Issue 1Feb 2022, Pages 19–36https://doi.org/10.1007/s00446-021-00410-wAbstractWe investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the objects it needs, executes once those ...
- research-articleFebruary 2022
On atomic registers and randomized consensus in M&M systems
Distributed Computing (DICO), Volume 35, Issue 1Feb 2022, Pages 81–103https://doi.org/10.1007/s00446-021-00405-7AbstractMotivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called the message-and-memory model or m&m model for short. In this model, processes can communicate by message passing and ...
- editorialDecember 2021
- research-articleOctober 2021
Optimistically tuning synchronous byzantine consensus: another win for null messages
Distributed Computing (DICO), Volume 34, Issue 5Oct 2021, Pages 395–410https://doi.org/10.1007/s00446-021-00393-8AbstractModular methods that transform Byzantine consensus protocols for the synchronous model into ones that are fast and communication efficient in failure-free executions are presented. Small and short protocol segments called layers are custom ...
- editorialAugust 2021
- research-articleFebruary 2021
Tractable low-delay atomic memory
- Antonio Fernández Anta,
- Theophanis Hadjistasi,
- Nicolas Nicolaou,
- Alexandru Popa,
- Alexander A. Schwarzmann
Distributed Computing (DICO), Volume 34, Issue 1Feb 2021, Pages 33–58https://doi.org/10.1007/s00446-020-00379-yAbstractCommunication cost is the most commonly used metric in assessing the efficiency of operations in distributed algorithms for message-passing environments. In doing so, the standing assumption is that the cost of local computation is negligible ...