Filters








844 Hits in 8.9 sec

Set-Constrained Delivery Broadcast

Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
2018 Proceedings of the 19th International Conference on Distributed Computing and Networking - ICDCN '18  
This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast) , whose aim is to provide its users with an appropriate abstraction level when they have  ...  to implement objects or distributed tasks in an asynchronous message-passing system prone to process crash failures.  ...  ANR project 16-CE40-0023-03 DESCARTES (devoted to layered and modular structures in distributed computing).  ... 
doi:10.1145/3154273.3154296 dblp:conf/icdcn/ImbsMPR18 fatcat:6z3pafgne5hr3m6pabdi4qehsm

Byzantine-Tolerant Set-Constrained Delivery Broadcast

Alex Auvolat, Michel Raynal, François Taïani, Michael Wagner
2020 International Conference on Principles of Distributed Systems  
Set-Constrained Delivery Broadcast (SCD-broadcast) , recently introduced at ICDCN 2018, is a high-level communication abstraction that captures ordering properties not between individual messages but between  ...  As an illustration of the high abstraction power provided by the BSCD-broadcast primitive, we show that it can be used to implement a Byzantine-tolerant read/write snapshot object in an extremely simple  ...  The proof that Algorithm 1 implements BFIFO-broadcast is provided in Appendix B.1. 6:6 Byzantine-Tolerant Set-Constrained Delivery Broadcast Algorithm 1 BFIFO-broadcast on top of MBR-broadcast (code  ... 
doi:10.4230/lipics.opodis.2019.6 dblp:conf/opodis/AuvolatRT19 fatcat:kvcrta7tafgo5fjavryj7miphy

Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits [article]

Damien Imbs, Matthieu Perrin, Michel Raynal
2017 arXiv   pre-print
This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have  ...  to implement objects or distributed tasks in an asynchronous message-passing system prone to process crash failures.  ...  ANR project 16-CE40-0023-03 DESCARTES (devoted to layered and modular structures in distributed computing).  ... 
arXiv:1706.05267v1 fatcat:h2fexyzcenbb7ovtlvun77adv4

Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version) [article]

Damien Imbs, Matthieu Perrin, Michel Raynal
2017 arXiv   pre-print
To this end, the paper introduces a new communication abstraction, named SCD-broadcast (SCD standing for " Set Constrained Delivery "), which, instead of a single message, delivers to processes sets of  ...  The paper then shows that: (a) SCD-broadcast allows for a very simple implementation of a snapshot object (and consequently also of atomic read/write registers) in crash-prone asynchronous message-passing  ...  The authors want to thank Faith Ellen for fruitful exchanges on shared memory snapshot.  ... 
arXiv:1702.08176v1 fatcat:cj6tvjrvyjfupfop5a5aiazava

Reading & writing

2006 Language Teaching  
This article surveys the connection in the years up to 1920, and sets out to show which groups used which arguments to agitate for Esperanto, in order to throw light on the complexity of the relationship  ...  The history of Esperanto in China was for long periods closely linked with anarchism.  ...  culmination of a year-long writing-intensive humanities course, and reflections on that paper drawn from aReading & writing writer's memo.  ... 
doi:10.1017/s0261444806233858 fatcat:5rbjxtal3rfnzero5hwrxssib4

Which Broadcast Abstraction Captures k-Set Agreement? [article]

Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
2017 arXiv   pre-print
To this end, it introduces a new broadcast communication abstraction, called k-BO-Broadcast, which restricts the disagreement on the local deliveries of the messages that have been broadcast (1-BO-Broadcast  ...  This establishes a new "correspondence" between distributed agreement problems and communication abstractions, which enriches our understanding of the relations linking fundamental issues of fault-tolerant  ...  ANR project 16-CE40-0023-03 DESCARTES (devoted to layered and modular structures in distributed computing).  ... 
arXiv:1705.04835v1 fatcat:5ml52uelwbcufgktmhvewzzdti

Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems [article]

Achour Mosteafoui, Matoula Petrolia, Michel Raynal, Claude Jard
2015 arXiv   pre-print
This article presents a signature-free distributed algorithm which builds an atomic read/write shared memory on top of an n-process asynchronous message-passing system in which up to t<n/3 processes may  ...  A read operation requires O(n) messages, and a write operation requires O(n^2) messages.  ...  devoted to connections between mathematics and distributed computing), and the French ANR project CO 2 Dim.  ... 
arXiv:1604.08161v1 fatcat:gr4ie5icffe4rnlhowvzdtufle

Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems

Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard
2016 Theory of Computing Systems  
This article presents a signature-free distributed algorithm which builds an atomic read/write shared memory on top of an n-process asynchronous message-passing system in which up to t < n/3 processes  ...  Mots clés : systèmes asynchrones à passage de messages, registres atomiques read/write, diffusion fiable, processus Byzantins.  ...  devoted to connections between mathematics and distributed computing), and the French ANR project CO 2 Dim.  ... 
doi:10.1007/s00224-016-9699-8 fatcat:xqu6mdwihrd3th2txc7r5lhqru

RT-ByzCast: Byzantine-Resilient Real-Time Reliable Broadcast

David Kozhaya, Jeremie Decouchant, Paulo Esteves-Verissimo
2019 IEEE transactions on computers  
We first prove that it is impossible to implement RTBRB using traditional distributed computing paradigms, e.g., where the error/failure detection mechanisms of processes are decoupled from the broadcast  ...  We show that RT-ByzCast (i) operates in real-time by proving that messages broadcast by correct processes are delivered within a known bounded delay, and (ii) is reliable by demonstrating that correct  ...  The two states of the GE model (Fig. 5) , noted by good and bad, can for example abstract the following: the communication link between a pair of processes occupies the bad state when the packet success-rate  ... 
doi:10.1109/tc.2018.2871443 fatcat:g2hfxqkn7jgwvfi3nnovitari4

RT-ByzCast: Byzantine-Resilient Real-Time Reliable Broadcast [article]

David Kozhaya and Jérémie Decouchant and Paulo Esteves-Verissimo
2018 arXiv   pre-print
We first prove that it is impossible to implement RTBRB using traditional distributed computing paradigms, e.g., where the error/failure detection mechanisms of processes are decoupled from the broadcast  ...  We show that RT-ByzCast (i) operates in real-time by proving that messages broadcast by correct processes are delivered within a known bounded delay, and (ii) is reliable by demonstrating that correct  ...  We then prove that in systems where processes can be Byzantine and communication can simultaneously fail, it is impossible to implement the RTBRB abstraction using traditional distributed computing assumptions  ... 
arXiv:1807.01226v1 fatcat:j6kws4jy5ndlhbm2wgi7bdj6pa

Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof [article]

Alex Auvolat
2021 arXiv   pre-print
Moreover, as a side effect of the proposed algorithm, it follows that money transfer is a weaker problem than the construction of a safe/regular/atomic read/write register in the asynchronous message-passing  ...  The genericity dimension lies in the underlying reliable broadcast abstraction which must be suited to the appropriate failure model.  ...  Acknowledgments This work was partially supported by the French ANR projects 16-CE40-0023-03 DESCARTES, devoted to layered and modular structures in distributed computing, and ANR-16-CE25-0005-03 O'Browser  ... 
arXiv:2006.12276v2 fatcat:czdqffxc2jd5hogsz3uikzrrrq

A style-aware architectural middleware for resource-constrained, distributed systems

S. Malek, M. Mikic-Rakic, N. Medvidovic
2005 IEEE Transactions on Software Engineering  
A recent emergence of small, resource-constrained, and highly mobile computing platforms presents numerous new challenges for software developers.  ...  Recently, Prism-MW has been successfully evaluated by a major industrial organization for use in one of their key distributed embedded systems.  ...  Mattmann, A. Rampurwala, E. Sanchez, V. Viswanathan, and students from USC's CSCI 578 and 589 courses who contributed to the development of Prism-MW and various applications on top of it.  ... 
doi:10.1109/tse.2005.29 fatcat:uttegdvmdzdwlgncko327ghyri

Partition Consistency: A Case Study in Modeling Systems with Weak Memory Consistency and Proving Correctness of their Implementations [article]

Steven Cheng, Lisa Higham, Jalal Kawash
2013 arXiv   pre-print
The paper aims to illustrate a general methodology and techniques for specifying memory consistency models and proving the correctness of their implementations.  ...  Abstract memory consistency models aim to capture the concrete implementations and architectures.  ...  PC(K) only has read/write variable objects, so there are four cases for o 1 , o 2 . Notice that if o 1 or o 2 is a READ then o 1 , o 2 ∈ O|p.  ... 
arXiv:1306.0077v1 fatcat:b3fr4schpfc3vcxakpcjb65fqa

Asynchronous Complex Analytics in a Distributed Dataflow Architecture [article]

Joseph E. Gonzalez, Peter Bailis, Michael I. Jordan, Michael J. Franklin, Joseph M. Hellerstein, Ali Ghodsi, Ion Stoica
2015 arXiv   pre-print
We evaluate an implementation of ASIPs within on Apache Spark that exhibits considerable speedups as well as a rich set of performance trade-offs in the use of these asynchronous algorithms.  ...  Specifically, we investigate the use of asynchronous sideways information passing (ASIP) that presents single-stage parallel iterators with a Volcano-like intra-operator iterator that can be used for asynchronous  ...  For now, we restrict our attention to simple, best-effort, uniform broadcast communication (see Section 5).  ... 
arXiv:1510.07092v1 fatcat:32qafevpyjdfffjl64fvpkwnyi

Programming in Mobile Ad Hoc Networks

Justin Collins, Rajive Bagrodia
2008 Proceedings of the 4th International ICST Conference on Wireless Internet  
These applications face the challenges of frequent disconnections, highly dynamic network topologies, and varying communication patterns, a combination unique to mobile ad hoc networks.  ...  We suggest that these approaches are essentially extensions to existing distributed and parallel computing concepts and new abstractions may be necessary to fully handle the programming issues presented  ...  Tuple spaces generally operate by reading, writing, and taking tuples to and from a shared location.  ... 
doi:10.4108/icst.wicon2008.4932 dblp:conf/wicon/CollinsB08 fatcat:tc4stsnzknhsfna7bglhdlddxi
« Previous Showing results 1 — 15 out of 844 results