Wednesday, 14 December 2011

Herlihy, Shavit: “The topological structure of asynchronous computation” Saks, Zaharoglou: “Wait-free k-set agreement is impossible …”

Herlihy, Maurice; Shavit, Nir (1999), "The topological anatomy of asynchronous computation", Journal of the ACM 46 (6): 858–923, doi:10.1145/331524.331529. Gödel award-winning lecture.

Saks, Michael; Zaharoglou, Fotios (2000), "Wait-free k-set acceding is impossible: The cartography of accessible knowledge"", SIAM Journal on Computing 29 (5): 1449–1483, doi:10.1137/S0097539796307698.

These two affidavit abstraction wait-free algorithms for generalisations of the accord problem, and showed that these problems can be analysed by application topological backdrop and arguments. Both affidavit accustomed the Gödel Award-winning in 2004.4

No comments:

Post a Comment