Show simple item record

dc.contributor.authorWang, Xianbing
dc.contributor.authorTeo, Yong Meng
dc.date.accessioned2005-12-14T19:17:36Z
dc.date.available2005-12-14T19:17:36Z
dc.date.issued2006-01
dc.identifier.urihttp://hdl.handle.net/1721.1/30247
dc.description.abstractExisting Global Data Computation (GDC) protocols for asynchronous systems are designed for fully connected networks. In this paper, we discuss GDC in a dedicated asynchronous chordal ring, a type of un-fully connected networks. The virtual links approach, which constructs t+1 (t<n) process-disjoint paths for each pair of processes without direct connection to tolerate failures (where t is the maximum number of processes that may crash and n is the total number of processes), can be applied to solve the GDC problem in the chordal but the virtual links approach incurs high message complexity. To reduce the high communication cost, we propose a non round-based GDC protocol for the asynchronous chordal ring with perfect failure detectors. The main advantage of our approach is that there is no notion of round, processes only send messages via direct connections and the implementation of failure detectors does not require process-disjoint paths. Analysis and comparison with the virtual links approach shows that our protocol reduces the message complexity significantly.en
dc.description.sponsorshipSingapore-MIT Alliance (SMA)en
dc.format.extent293646 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.relation.ispartofseriesComputer Science (CS)en
dc.subjectdata computationen
dc.subjectchordal ringsen
dc.subjectperfect failure detectoren
dc.titleGlobal Data Computation in a Dedicated Chordal Ringen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record