1 / 3

Efficient Failure Detector: Send/Receive Model for Omission Scenarios

Explore a novel failure detection model for omission scenarios, distinguishing between send/receive, permanent/transient, and selective/non-selective parameters. Based on partially synchronous systems with reliable communication, our approach minimizes link usage through a spanning tree among well-connected processes. Discover our communication-efficient implementation requiring at most 2(n-1) links indefinitely. Presented at PODC’2010 in Zurich, Switzerland on July 25-28, our BFS spanning tree utilized 10 links for n=7.

mireya
Télécharger la présentation

Efficient Failure Detector: Send/Receive Model for Omission Scenarios

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Brief Announcement:An Efficient Failure Detectorfor Omission Environments R. Cortiñas, I. Soraluze, A. Lafuente, M. Larrea University of the Basque Country, UPV/EHU

  2. Why do you have to read our BA • We propose a new failure detector for the general omission model: • send / receive • permanent / transient • non selective / selective • Assumptions: • partially synchronous distributed system • reliable communication • majority of correct processes • Communication-efficient implementation: • at most 2(n-1) links are used forever • spanning tree among well-connected processes PODC’2010 − Zurich, Switzerland, July 25-28, 2010

  3. Communication Efficiency BFS spanning tree n = 7 10 links are used (forever) PODC’2010 − Zurich, Switzerland, July 25-28, 2010

More Related