Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/105564
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Mostéfaoui, A | - |
dc.creator | Perrin, M | - |
dc.creator | Raynal, M | - |
dc.creator | Cao, J | - |
dc.date.accessioned | 2024-04-15T07:35:03Z | - |
dc.date.available | 2024-04-15T07:35:03Z | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | http://hdl.handle.net/10397/105564 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier BV | en_US |
dc.rights | ©2019 Elsevier B.V. All rights reserved. | en_US |
dc.rights | ©2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/ | en_US |
dc.rights | The following publication Mostefaoui, A., Perrin, M., Raynal, M., & Cao, J. (2019). Crash-tolerant causal broadcast in O (n) messages. Information Processing Letters, 151, 105837 is available at https://doi.org/10.1016/j.ipl.2019.105837. | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Distributed computing | en_US |
dc.subject | Fault-tolerance | en_US |
dc.subject | Reliable communication | en_US |
dc.title | Crash-tolerant causal broadcast in O(n) messages | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 151 | - |
dc.identifier.doi | 10.1016/j.ipl.2019.105837 | - |
dcterms.abstract | Causal broadcast is a communication abstraction designed for asynchronous systems. It ensures that the messages broadcast by the processes are delivered in their broadcast causality order, namely, if the broadcast of a message m causally precedes the broadcast of a message m′, no process delivers m′ unless it has previously delivered m. Several algorithms implementing causal broadcast have been proposed for asynchronous systems prone to any number of process crashes. These algorithms rely on an underlying Reliable Broadcast abstraction, whose message cost is n2. This paper presents a simple causal broadcast algorithm whose cost is n messages per causal broadcast. This is obtained at the cost of protocol messages whose size can be up to n application messages. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Information processing letters, Nov. 2019, v. 151, 105837 | - |
dcterms.isPartOf | Information processing letters | - |
dcterms.issued | 2019-11 | - |
dc.identifier.scopus | 2-s2.0-85073704812 | - |
dc.identifier.eissn | 1872-6119 | - |
dc.identifier.artn | 105837 | - |
dc.description.validate | 202402 bcch | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | COMP-0498 | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | French ANR project | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 22964239 | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Raynal_Crash-Tolerant_Causal_Broadcast.pdf | Pre-Published version | 830.58 kB | Adobe PDF | View/Open |
Page views
13
Citations as of Jul 7, 2024
Downloads
4
Citations as of Jul 7, 2024
SCOPUSTM
Citations
9
Citations as of Jul 4, 2024
WEB OF SCIENCETM
Citations
6
Citations as of Jul 4, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.