
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Roberto Baldoni, Silvia Bonomi, Michel Raynal, "Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 1, pp. 102109, January, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.97, author = {Roberto Baldoni and Silvia Bonomi and Michel Raynal}, title = {Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {1}, issn = {10459219}, year = {2012}, pages = {102109}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.97}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn IS  1 SN  10459219 SP102 EP109 EPD  102109 A1  Roberto Baldoni, A1  Silvia Bonomi, A1  Michel Raynal, PY  2012 KW  Regular register KW  dynamic distributed systems KW  churn KW  distributed algorithms. VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] M.K. Aguilera, I. Keidar, D. Malkhi, and A. Shraer, “Dynamic Atomic Storage without Consensus,” Proc. 28th Ann. ACM Symp. Principles of Distributed Computing (PODC), pp. 1725, 2009.
[2] E. Anderson, X. Li, M.A. Shah, J. Tucek, and J.J. Wylie, “What Consistency Does Your KeyValue Store Actually Provide?,” Proc. Sixth Workshop Hot Topics in System Dependability (HotDep), 2010.
[3] H. Attiya, A. BarNoy, and D. Dolev, “Sharing Memory Robustly in MessagePassing Systems,” J. ACM, vol. 42, no. 1, pp. 129142, 1995.
[4] R. Baldoni, S. Bonomi, A.M. Kermarrec, and M. Raynal, “Implementing a Register in a Dynamic Distributed System,” Proc. 29th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '09), June 2009.
[5] R. Baldoni, S. Bonomi, and M. Raynal, “Regular Register: An Implementation in a Churn Prone Environment,” Proc 16th Int'l Colloquium on Structural Information and Comm. Complexity (SIROCCO), pp. 1529, 2009.
[6] R. Baldoni and A.A. Shvartsman, “Theoretical Aspects of Dynamic Distributed Systems: Report on the Workshop,” SIGACT News, vol. 40, no. 4, pp. 8789, 2009.
[7] T. Chandra and S. Toueg, “Unreliable Failure Detectors for Reliable Distributed Systems,” J. ACM, vol. 43, no. 2, pp. 225267, 1996.
[8] G. Chockler, S. Gilbert, V. Gramoli, P.M. Musial, and A. Shvartsman, “Reconfigurable Distributed Storage for Dynamic Networks,” J. Parallel Distributed Computing, vol. 69, no. 1, pp. 100116, 2009.
[9] C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the Presence of Partial Synchrony,” J. ACM, vol. 35, no. 2, pp. 288323, 1988.
[10] R. Friedman, M. Raynal, and C. Travers, “Abstractions for Implementing Atomic Objects in Distributed Systems,” Proc. Ninth Int'l Conf. Principles of Distributed Systems (PODC '05), pp. 7387, 2005.
[11] S. Gilbert, N. Lynch, and A. Shvartsman, “RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks,” Proc. Int'l Conf. Dependable Systems and Networks (DSN), 2003.
[12] R. Guerraoui, R.R. Levy, B. Pochon, and J. Pugh, “The Collective Memory of Amnesic Processes,” ACM Trans. Algorithms, vol. 4, no. 1, pp. 131, 2008.
[13] B. Godfrey, S. Shenker, and I. Stoica, “Minimizing Churn in Distributed Systems,” Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM), pp. 147158, 2006.
[14] S. Guha, N. Daswani, and R. Jain, “An Experimental Study of the Skype PeertoPeer VoIP System,” Proc. Fifth Int'l Workshop PeertoPeer Systems (IPTPS), 2006.
[15] S. Ko, I. Hoque, and I. Gupta, “Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols,” Proc. 27th IEEE Int'l Symp. Reliable Distributed Systems (SRDS '08), 2008.
[16] F. Kuhn, S. Schmid, and R. Wattenhofer, “A SelfRepairing PeertoPeer System Resilient to Dynamic Adversarial Churn,” Proc. Fourth Int'l Workshop PeertoPeer Systems (IPTPS), pp. 323, 2005.
[17] F. Kuhn, S. Schmid, J. Smit, and R. Wattenhofer, “A Blueprint for Constructing PeertoPeer Systems Robust to Dynamic WorstCase Joins and Leaves,” Proc. 14th IEEE Int'l Workshop Quality of Service (IWQoS), 2006.
[18] L. Lamport, “On Interprocess Communication, Part 1: Models, Part 2: Algorithms,” Distributed Computing, vol. 1, no. 2, pp. 77101, 1986.
[19] D. LibenNowell, H. Balakrishnan, and D.R. Karger, “Analysis of the Evolution of PeertoPeer Systems,” Proc. 21th Symp. Ann. Principles of Distributed Computing (PODC), pp. 233242, 2002.
[20] D. LibenNowell, D.R. Karger, M.F. Kaashoek, F. Dabek, H. Balakrishnan, I. Stoica, and R. Morris, “Chord: A Scalable PeertoPeer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 1732, Feb. 2003.
[21] N. Lynch and A. Shvartsman, “RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks,” Proc. 16th Int'l Symp. Distributed Computing (DISC '02), pp. 173190, 2002.
[22] D. Malkhi and M.K. Reiter, “Byzantine Quorum Systems,” Distributed Computing, vol. 11, no. 4, pp. 203213, 1998.
[23] A. Mostefaoui, M. Raynal, C. Travers, S. Peterson, E.l. Abbadi, and D. Agrawal, “From Static Distributed Systems to Dynamic Systems,” Proc. 24th IEEE Symp. Reliable Distributed Systems (SRDS '05), pp. 109119, 2005.
[24] M. Merritt and G. Taubenfeld, “Computing with Infinitely Many Processes,” Proc. 14th Int'l Symp. Distributed Computing (DISC '00), pp. 164178, 2000.
[25] C. Shao, E. Pierce, and J. Welch, “MultiWriter Consistency Conditions for Shared Memory Objects,” Proc. 17th Int'l Symp. Distributed Computing (DISC '03), pp. 106120, 2003.
[26] P. Sousa, A.N. Bessani, M. Correia, N.F. Neves, and P. Verssimo, “Highly Available IntrusionTolerant Services with ProactiveReactive Recovery,” IEEE Trans. Parallel and Distributed Systems vol. 21, no. 4, pp. 452465, Apr. 2010.
[27] S. Voulgaris, D. Gavidia, and M. van Steen, “CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays,” J. Network and Systems Management, vol. 13, no. 2, pp. 197217, 2005.