Date
Paper
21/10/2013
28/10/2013
Introduction
Atomic snapshots
Basic algorithms: O(n^2), Attiya and Rachman
Inoue, Masuzawa, Chen, Tokura, Linear-time snapshot using multi-writer multireader registers, WDAG 1994
Link: http://link.springer.com/chapter/10.1007/BFb0020429
Jayanti, An optimal multi-writer snapshot algorithm, STOC 2005
Link: http://dx.doi.org/10.1145/1060590.1060697
Aspnes, Attiya, Censor-Hillel, Ellen, Faster than Optimal Snapshots for a While, PODC
2012
Link: http://dx.doi.org/10.1145/2332432.2332507
Aspnes, Censor-Hillel, Atomic Snapshots in O(log^3 n) Steps Using Randomized
Helping, DISC 2013
Link: http://link.springer.com/chapter/10.1007/978-3-642-41527-2_18
Helmi, Higham, Pacheco, and Woelfel, The Space Complexity of Long-Lived and OneShot Timestamp Implementations, PODC 2011, pages 139-148 (lower bound)
Link: http://dx.doi.org/10.1145/1993806.1993826
Helmi, Higham, Pacheco, and Woelfel, The Space Complexity of Long-Lived and OneShot Timestamp Implementations, PODC 2011, pages 139-148 (upper bound)
Giakkoupis, Helmi, Higham, and Woelfel, An O(\sqrt{n}) Space Bound for
Obstruction-Free Leader Election, DISC 2013
Link: http://link.springer.com/chapter/10.1007/978-3-642-41527-2_4
Space complexity of consensus
Fich, Herlihy and Shavit, On the Space Complexity of Randomized Synchronization,
JACM 45, 1998, pages 843-862
Link: http://dx.doi.org/10.1145/290179.290183
Dynamic storage
Gilbert, Lynch, Shvartsman, Rambo: a robust, reconfigurable atomic memory service
for dynamic networks. Distributed Computing 23(4): 225-272 (2010)
Link: http://dx.doi.org/10.1007/s00446-010-0117-1
4/11/2013
11/11/2013
18/11/2013
25/11/2013
9/12/2013
Presented
by
Hagit
Maya
Sandeep
Sandeep
Keren
Faith
Hagit
Maya
Faith
Anastasia
16/12/2013
23/12/2013
30/12/2013
6/1/2014
13/1/2014
20/1/2013
Aguilera, Keidar, Malkhi, Shraer, Dynamic atomic storage without consensus. J. ACM
58, 2, 2011
Link: http://dx.doi.org/10.1145/1944345.1944348
Vector agreement
Mendes, Herlihy, Multidimensional approximate agreement in Byzantine
asynchronous systems. STOC 2013
Link: http://doi.acm.org/10.1145/2488608.2488657
Vaidya, Garg, Byzantine vector consensus in complete graphs. PODC 2013
Link: http://doi.acm.org/10.1145/2484239.2484256
Maximal independent set
Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem, SIAM J.
Comput., 15(4), 1036–1053
Link: http://epubs.siam.org/doi/abs/10.1137/0215074
Panconesi, Srinivasan, On the Complexity of Distributed Network Decomposition,
Journal of Algorithms, 20:2(356–374), 1996
Link: http://www.sciencedirect.com/science/article/pii/S0196677496900176
Linial, Locality in distributed graph algorithms, SIAM J. Comput., 21(1), 193–201
Link: http://epubs.siam.org/doi/abs/10.1137/0221015
Stack in common2
Routing
Thorup, Zwick, Compact routing schemes, SPAA 2001
Link: http://dx.doi.org/10.1145/378580.378581
Chechik, Compact Routing Schemes with Improved Stretch, PODC 2013
Link: http://dx.doi.org/10.1145/2484239.2484268
Renaming
Attiya, Castaneda, Herlihy, Paz, Upper bound on the complexity of solving hard
renaming, PODC 2013
Link: http://dx.doi.org/10.1145/2484239.2484251
Attiya, Paz, Counting-Based Impossibility Proofs for Renaming and Set Agreement.
DISC 2012: 356-370
Link: http://dx.doi.org/10.1007/978-3-642-33651-5_25
Sarai
Gil
Dima
Ogurtsov
Anat
Eliran
Ron
Adam
Armando
Yaakov
Shapiro
Hagit