Zobrazit v EDS

Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems

Uloženo v:
Podrobná bibliografie
Název: Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems
Autoři: Déprés, Mathilde, Mostéfaoui, Achour, Perrin, Matthieu, Raynal, Michel
Přispěvatelé: Taïani, François, Mathilde Déprés and Achour Mostéfaoui and Matthieu Perrin and Michel Raynal
Informace o vydavateli: Array, 2023.
Rok vydání: 2023
Témata: Consensus, Asynchrony, Computer systems organization → Fault-tolerant network topologies, Characterization, Test&, Lattice agreement, [INFO] Computer Science [cs], Test&Set, Message-passing, Read/Write register, Distributed Computability, Broadcast abstraction, Networks → Programming interfaces, Computability, Two-process communication, Message pattern, Distributed software engineering, Crash failure, Simplicity, Mutual exclusion, Theory of computation → Distributed computing models, ddc:004, Atomicity, Quorum, Read/write pattern, Set, amp
Popis: This paper is on the power and computability limits of messages patterns in crash-prone asynchronous message-passing systems. It proposes and investigates three basic messages patterns (encountered in all these systems) each involving two processes, and compares them to their Read/Write counterparts. It is first shown that one of these patterns has no Read/Write counterpart. The paper proposes then a new one-to-all broadcast abstraction, denoted Mutual Broadcast (in short MBroadcast), whose implementation relies on two of the previous messages patterns. This abstraction provides each pair of processes with the following property (called mutual ordering): for any pair of processes p and p', if p broadcasts a message m and p' broadcasts a message m', it is not possible for p to deliver first (its message) m and then m' while p' delivers first (its message) m' and then m. It is shown that MBroadcast and atomic Read/Write registers have the same computability power (independently of the number of crashes). Finally, in addition to its theoretical contribution, the practical interest of MBroadcast is illustrated by its (very simple) use to solve basic upper level coordination problems such as mutual exclusion and consensus. Last but not least, looking for simplicity was also a target of this article.
Druh dokumentu: Conference object
Article
Popis souboru: application/pdf
Jazyk: English
DOI: 10.4230/lipics.disc.2023.16
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.16
Rights: CC BY
Přístupové číslo: edsair.dedup.wf.002..c984f55b51e3a04aa6e4fa62a73678eb
Databáze: OpenAIRE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://explore.openaire.eu/search/publication?articleId=dedup_wf_002%3A%3Ac984f55b51e3a04aa6e4fa62a73678eb
    Name: EDS - OpenAIRE (s4221598)
    Category: fullText
    Text: View record at OpenAIRE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=D%C3%A9pr%C3%A9s%20M
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsair
DbLabel: OpenAIRE
An: edsair.dedup.wf.002..c984f55b51e3a04aa6e4fa62a73678eb
RelevancyScore: 899
AccessLevel: 3
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 898.779541015625
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Déprés%2C+Mathilde%22">Déprés, Mathilde</searchLink><br /><searchLink fieldCode="AR" term="%22Mostéfaoui%2C+Achour%22">Mostéfaoui, Achour</searchLink><br /><searchLink fieldCode="AR" term="%22Perrin%2C+Matthieu%22">Perrin, Matthieu</searchLink><br /><searchLink fieldCode="AR" term="%22Raynal%2C+Michel%22">Raynal, Michel</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Taïani, François<br />Mathilde Déprés and Achour Mostéfaoui and Matthieu Perrin and Michel Raynal
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Array, 2023.
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2023
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Consensus%22">Consensus</searchLink><br /><searchLink fieldCode="DE" term="%22Asynchrony%22">Asynchrony</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems+organization+→+Fault-tolerant+network+topologies%22">Computer systems organization → Fault-tolerant network topologies</searchLink><br /><searchLink fieldCode="DE" term="%22Characterization%22">Characterization</searchLink><br /><searchLink fieldCode="DE" term="%22Test%26amp%22">Test&amp</searchLink><br /><searchLink fieldCode="DE" term="%22Lattice+agreement%22">Lattice agreement</searchLink><br /><searchLink fieldCode="DE" term="%22[INFO]+Computer+Science+[cs]%22">[INFO] Computer Science [cs]</searchLink><br /><searchLink fieldCode="DE" term="%22Test%26Set%22">Test&Set</searchLink><br /><searchLink fieldCode="DE" term="%22Message-passing%22">Message-passing</searchLink><br /><searchLink fieldCode="DE" term="%22Read%2FWrite+register%22">Read/Write register</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+Computability%22">Distributed Computability</searchLink><br /><searchLink fieldCode="DE" term="%22Broadcast+abstraction%22">Broadcast abstraction</searchLink><br /><searchLink fieldCode="DE" term="%22Networks+→+Programming+interfaces%22">Networks → Programming interfaces</searchLink><br /><searchLink fieldCode="DE" term="%22Computability%22">Computability</searchLink><br /><searchLink fieldCode="DE" term="%22Two-process+communication%22">Two-process communication</searchLink><br /><searchLink fieldCode="DE" term="%22Message+pattern%22">Message pattern</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+software+engineering%22">Distributed software engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Crash+failure%22">Crash failure</searchLink><br /><searchLink fieldCode="DE" term="%22Simplicity%22">Simplicity</searchLink><br /><searchLink fieldCode="DE" term="%22Mutual+exclusion%22">Mutual exclusion</searchLink><br /><searchLink fieldCode="DE" term="%22Theory+of+computation+→+Distributed+computing+models%22">Theory of computation → Distributed computing models</searchLink><br /><searchLink fieldCode="DE" term="%22ddc%3A004%22">ddc:004</searchLink><br /><searchLink fieldCode="DE" term="%22Atomicity%22">Atomicity</searchLink><br /><searchLink fieldCode="DE" term="%22Quorum%22">Quorum</searchLink><br /><searchLink fieldCode="DE" term="%22Read%2Fwrite+pattern%22">Read/write pattern</searchLink><br /><searchLink fieldCode="DE" term="%22Set%22">Set</searchLink><br /><searchLink fieldCode="DE" term="%22amp%22">amp</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: This paper is on the power and computability limits of messages patterns in crash-prone asynchronous message-passing systems. It proposes and investigates three basic messages patterns (encountered in all these systems) each involving two processes, and compares them to their Read/Write counterparts. It is first shown that one of these patterns has no Read/Write counterpart. The paper proposes then a new one-to-all broadcast abstraction, denoted Mutual Broadcast (in short MBroadcast), whose implementation relies on two of the previous messages patterns. This abstraction provides each pair of processes with the following property (called mutual ordering): for any pair of processes p and p', if p broadcasts a message m and p' broadcasts a message m', it is not possible for p to deliver first (its message) m and then m' while p' delivers first (its message) m' and then m. It is shown that MBroadcast and atomic Read/Write registers have the same computability power (independently of the number of crashes). Finally, in addition to its theoretical contribution, the practical interest of MBroadcast is illustrated by its (very simple) use to solve basic upper level coordination problems such as mutual exclusion and consensus. Last but not least, looking for simplicity was also a target of this article.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: Conference object<br />Article
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.4230/lipics.disc.2023.16
– Name: URL
  Label: Access URL
  Group: URL
  Data: <link linkTarget="URL" linkTerm="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.16" linkWindow="_blank">https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.16</link>
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: CC BY
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsair.dedup.wf.002..c984f55b51e3a04aa6e4fa62a73678eb
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsair&AN=edsair.dedup.wf.002..c984f55b51e3a04aa6e4fa62a73678eb
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.4230/lipics.disc.2023.16
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Consensus
        Type: general
      – SubjectFull: Asynchrony
        Type: general
      – SubjectFull: Computer systems organization → Fault-tolerant network topologies
        Type: general
      – SubjectFull: Characterization
        Type: general
      – SubjectFull: Test&amp
        Type: general
      – SubjectFull: Lattice agreement
        Type: general
      – SubjectFull: [INFO] Computer Science [cs]
        Type: general
      – SubjectFull: Test&Set
        Type: general
      – SubjectFull: Message-passing
        Type: general
      – SubjectFull: Read/Write register
        Type: general
      – SubjectFull: Distributed Computability
        Type: general
      – SubjectFull: Broadcast abstraction
        Type: general
      – SubjectFull: Networks → Programming interfaces
        Type: general
      – SubjectFull: Computability
        Type: general
      – SubjectFull: Two-process communication
        Type: general
      – SubjectFull: Message pattern
        Type: general
      – SubjectFull: Distributed software engineering
        Type: general
      – SubjectFull: Crash failure
        Type: general
      – SubjectFull: Simplicity
        Type: general
      – SubjectFull: Mutual exclusion
        Type: general
      – SubjectFull: Theory of computation → Distributed computing models
        Type: general
      – SubjectFull: ddc:004
        Type: general
      – SubjectFull: Atomicity
        Type: general
      – SubjectFull: Quorum
        Type: general
      – SubjectFull: Read/write pattern
        Type: general
      – SubjectFull: Set
        Type: general
      – SubjectFull: amp
        Type: general
    Titles:
      – TitleFull: Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Déprés, Mathilde
      – PersonEntity:
          Name:
            NameFull: Mostéfaoui, Achour
      – PersonEntity:
          Name:
            NameFull: Perrin, Matthieu
      – PersonEntity:
          Name:
            NameFull: Raynal, Michel
      – PersonEntity:
          Name:
            NameFull: Taïani, François
      – PersonEntity:
          Name:
            NameFull: Mathilde Déprés and Achour Mostéfaoui and Matthieu Perrin and Michel Raynal
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2023
          Identifiers:
            – Type: issn-locals
              Value: edsair
            – Type: issn-locals
              Value: edsairFT
ResultId 1