|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, "Developing a Consistent Domain-Oriented Distributed Object Service," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 11, pp. 1567-1585, November, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/TPDS.2008.243, author = {Chryssis Georgiou and Peter M. Musial and Alexander A. Shvartsman}, title = {Developing a Consistent Domain-Oriented Distributed Object Service}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {11}, issn = {1045-9219}, year = {2009}, pages = {1567-1585}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.243}, 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 - Developing a Consistent Domain-Oriented Distributed Object Service IS - 11 SN - 1045-9219 SP1567 EP1585 EPD - 1567-1585 A1 - Chryssis Georgiou, A1 - Peter M. Musial, A1 - Alexander A. Shvartsman, PY - 2009 KW - Distributed systems KW - specifying and verifying and reasoning about programs KW - algorithm and design analysis KW - reliability and robustness. VL - 20 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
[1] N. Lynch and A. Shvartsman, “RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks,” Proc. 16th Int'l Symp. Distributed Computing (DISC '02), pp. 173-190, 2002.
[2] 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 '03), pp. 259-268, 2003.
[3] S. Gilbert, N. Lynch, and A. Shvartsman, “RAMBO: A Robust, Reconfigurable Atomic Memory Service for Dynamic Networks,” technical report, MIT, CSAIL, 2008.
[4] C. Georgiou, P. Musial, and A. Shvartsman, “Long-Lived RAMBO: Trading Knowledge for Communication,” Theoretical Computer Science, vol. 383, no. 1, pp. 59-85, Sept. 2007.
[5] N. Lynch and M. Tuttle, “Hierarchical Correctness Proofs for Distributed Algorithms,” Proc. Sixth ACM Symp. Principles of Distributed Computing (PODC '87), pp. 137-151, 1987.
[6] N. Lynch, Distributed Algorithms. Morgan Kaufmann, 1996.
[7] P. Musial and A. Shvartsman, “Implementing a Reconfigurable Atomic Memory Service for Dynamic Networks,” Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2004.
[8] D. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM Symp. Operating Systems Principles (SOSP '79), pp. 150-162, 1979.
[9] R. Thomas, “A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[10] E. Upfal and A. Wigderson, “How to Share Memory in a Distributed System,” J. ACM, vol. 34, no. 1, pp. 116-127, Jan. 1987.
[11] B. Awerbuch and P. Vitanyi, “Atomic Shared Register Access by Asynchronous Hardware,” Proc. 27th IEEE Symp. Foundations of Computer Science (FOCS '86), pp. 233-243, 1986.
[12] H. Attiya, A. Bar-Noy, and D. Dolev, “Sharing Memory Robustly in Message Passing Systems,” J. ACM, vol. 42, no. 1, pp. 124-142, Jan. 1995.
[13] B. Englert and A. Shvartsman, “Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory,” Proc. 20th IEEE Int'l Conf. Distributed Computer Systems (ICDCS '00), pp.454-463, 2000.
[14] N. Lynch and A. Shvartsman, “Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts,” Proc. 27th IEEE Int'l Fault-Tolerant Computing Symp. (FTCS '97), pp.272-281, 1997.
[15] K. Birman and T. Joseph, “Exploiting Virtual Synchrony in Distributed Systems,” Proc. 11th ACM Symp. Operating Systems Principles (SOSP '87), Dec. 1987.
[16] Comm. ACM, special issue on group communication services, vol.39, no. 4, 1996.
[17] L. Lamport, “The Part-Time Parliament,” ACM Trans. Computer Systems, vol. 16, no. 2, pp. 133-169, 1998.

