Brief Announcement: Partial Reversal Acyclicity
Name
Lynch_Brief Announcement.pdf
Size
170.03 KB
Format
Adobe PDF
Checksum (MD5)
a0ffe6290f68871acf8df9c43f5223e0
Author(s)
Radeva, Tsvetomira
Lynch, Nancy A.
Date Issued
2011
Journal
Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '11)
Publisher
Association for Computing Machinery (ACM)
Citation
Tsvetomira Radeva and Nancy Lynch. "Brief Announcement: Partial Reversal Acyclicity." In Proceedings of the 30th annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '11). ACM, New York, NY, USA, 353-354.
Version
Author's final manuscript
Abstract
Partial Reversal (PR) is a link reversal algorithm which ensures that an initially directed acyclic graph (DAG) is eventually a destination-oriented DAG. While proofs exist to establish the acyclicity property of PR, they rely on assigning labels to either the nodes or the edges in the graph. In this work we show that such labeling is not necessary and outline a simpler direct proof of the acyclicity property.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1993806.1993880
