Peter Musial
Skip Abstract Section
Skip Supplemental Material SectionAbstract
Atomically consistent memory services provide resiliency in dynamic settings.
Supplemental Material
Available for Download
pdf
p88-musial-supp.pdf (65.4 KB)
Supplemental file.
- Aguilera, M., Keidar, I., Martin, J.-P. and Shraer, A. Reconfiguring replicated atomic storage: A tutorial. Bulletin of the EATCS 102 (Oct. 2010), 84--108.Google Scholar
- Aguilera, M.K., Keidar, I., Malkhi, D. and Shraer, A. Dynamic atomic storage without consensus. JACM 58 (Apr. 2011), 7:1--7:32. Google ScholarDigital Library
- Attiya, H., Bar-Noy, A. and Dolev, D. Sharing memory robustly in message-passing systems. JACM 42, 1 (Jan. 1995), 124--142. Google ScholarDigital Library
- Attiya, H. and Welch, J.L. Sequential consistency versus linearizability. ACM Trans. Comput. Syst. 12, 2 (May 1994), 91--122. Google ScholarDigital Library
- Birman, K. A history of the virtual synchrony replication model. Replication: Theory and Practice, LNCS vol. 5959 (2010), 91--120. Google ScholarDigital Library
- Birman, K., Malkhi, D. and Renesse, R.V. Virtually synchronous methodology for dynamic service replication. Technical report, MSR-TR-2010-151, Microsoft Research, 2010.Google Scholar
- Brewer, E.A. Towards robust distributed systems, July 2000.Google Scholar
- Brewer, E.A. Pushing the cap: Strategies for consistency and availability. IEEE Computer 45, 2 (2012), 23--29. Google ScholarDigital Library
- Calder, B. et al. Windows azure storage: A highly available cloud storage service with strong consistency. In Proceedings of SOSP '11 (Oct 23-26, 2011), 143--157. Google ScholarDigital Library
- Chandra, T.D., Hadzilacos, V. and Toueg, S. The weakest failure detector for solving consensus. JACM (1996), 685--722. Google ScholarDigital Library
- Chockler, G., Gilbert, S., Gramoli, V., Musial, P.M. and Shvartsman, A.A. Reconfigurable distributed storage for dynamic networks. J. Parallel and Distributed Computing 69, 1 (2009), 100--116. Google ScholarDigital Library
- Chockler, G., Guerraoui, R., Keidar, I. and Vukolić, M. Reliable distributed storage. IEEE Computer, 2008. Google ScholarDigital Library
- Corbett, J.C. et al. Spanner: Google's globally distributed database. In Proceedings of the 10th USENIX Symp. On Operating Sys. Design and Implementation (2012), 251--264. Google ScholarDigital Library
- De Prisco, R., Fekete, A., Lynch, N.A. and Shvartsman, A.A. A dynamic primary configuration group communication service. In Proceedings of the 13th Int-l Symposium on Distributed Computing. Springer-Verlag, 1999, 64--78. Google ScholarDigital Library
- DeCandia, G. et al. Dynamo: Amazon's highly available key-value store. In Proceedings of SIGOPS Oper. Syst. Rev. 41, 6 (Oct. 2007), 205--220. Google ScholarDigital Library
- Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A. and Welch, J. GeoQuorums: Implementing atomic memory in ad hoc networks. In Proceedings of the 17th International Symposium on Distributed Computing (2003), 306--320.Google ScholarCross Ref
- Dutta, P., Guerraoui, R., Levy, R.R. and Vukolić, M. Fast access to distributed atomic memory. SIAM J. Comput. 39, 8 (Dec. 2010), 3752--3783. Google ScholarDigital Library
- Fekete, A., Lynch, N. and Shvartsman, A. Specifying and using a partitionable group communication service. ACM Trans. Comput. Syst. 19, 2 (2001), 171--216. Google ScholarDigital Library
- Fischer, M.J., Lynch, N.A. and Paterson, M.S. Impossibility of distributed consensus with one faulty process. JACM 32, 2 (1985), 374-382. Google ScholarDigital Library
- Georgiou, C., Musial, P.M. and Shvartsman, A.A. Developing a consistent domain-oriented distributed object service. IEEE Transactions of Parallel and Distributed Systems 20, 11 (2009), 1567--1585. Google ScholarDigital Library
- Georgiou, C., Musial, P.M. and Shvartsman, A.A. Fault-tolerant semifast implementations of atomic read/write registers. J. Parallel and Distributed Computing 69, 1 (Jan. 2009), 62--79. Google ScholarDigital Library
- Ghemawat, S., Gobioff, H. and Leung, S.-T. The Google File System. In Proceedings of the 19th ACM Symposium on Operating Systems Principles (2003), 29--43. Google ScholarDigital Library
- Gilbert, S. and Lynch, N. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33 (June 2002), 51--59. Google ScholarDigital Library
- Gilbert, S., Lynch, N. and Shvartsman, A. RAMBO: A robust, reconfigurable atomic memory service for dynamic networks. Distributed Computing 23, 4, (Dec. 2010), 225--272.Google ScholarDigital Library
- Herlihy, M.P. and Wing, J.M. Linearizability: A correctness condition for concurrent objects. ACM Trans. Programming Languages and Systems 12, 3 (July 1990), 463--492. Google ScholarDigital Library
- Imieliński, T. and Navas, J.C. GPS-based geographic addressing, routing, and resource discovery. Commun. ACM 42, 4 (Apr. 1999), 86--92. Google ScholarDigital Library
- Lakshman, A. and Malik, P. Cassandra: A decentralized structured storage system. SIGOPS Oper. Syst. Rev. 44, 2 (Apr. 2010), 35--40. Google ScholarDigital Library
- Lamport, L. On interprocess communication. Part I: Basic formalism. Distributed Computing 2, 1 (1986), 77--85.Google Scholar
- Lamport, L. The part-time parliament. ACM Trans. Comput. Syst. 16, 2 (1998), 133--169. Google ScholarDigital Library
- Liskov, B. The power of abstraction. In Proceedings of the 24th Int-l Symposium Distributed Computing. N.A. Lynch and A.A. Shvartsman, Eds. LNCS, vol. 6343, Springer, 2010. Google ScholarDigital Library
- Loui, M.C. and Abu-Amara, H.H. Memory requirements for agreement among unreliable asynchronous processes. In Parallel and Distributed Computing, Vol 4 of Advances in Computing Research. F.P. Preparata, Ed. JAI Press, Greenwich, Conn., 1987, 163--183.Google Scholar
- Lynch, N. and Shvartsman, A. Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In Symposium on Fault-Tolerant Computing. IEEE, 1997, 272--281. Google ScholarDigital Library
- Lynch, N.A. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996. Google ScholarDigital Library
- Martin, J.-P. and Alvisi, L. A framework for dynamic byzantine storage. In Proc. Intl. Conf. on Dependable Systems and Networks, 2004. Google ScholarDigital Library
- Rodrigues, R., Liskov, B., Chen, K., Liskov, M. and Schultz, D. Automatic reconfiguration for large-scale reliable storage systems. IEEE Trans. on Dependable and Secure Computing 9, 2 (2012), 145--158. Google ScholarDigital Library
- Saito, Y., Frølund, S., Veitch, A., Merchant, A. and Spence, S. Fab: Building distributed enterprise disk arrays from commodity components. SIGARCH Comput. Archit. News 32, 5 (Oct. 2004), 48--58. Google ScholarDigital Library
- Shraer, A. Martin, J.-P., Malkhi, D. and Keidar, I. Data-centric reconfiguration with network-attached disks. In Proceedings of the 4th Int'l Workshop on Large Scale Distributed Systems and Middleware (2010), ACM, 22--26. Google ScholarDigital Library
- Vukolić, M. Quorum systems: With applications to storage and consensus. Synthesis Lectures on Distributed Computing Theory 3, (Jan. 3, 2012). 1--146.Google ScholarCross Ref
Index Terms
- Implementing distributed shared memory for dynamic networks
Recommendations
Implementing Distributed Read-Only Transactions
This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to ...
Software Distributed Shared Memory with Transactional Coherence - A Software Engine to Run Transactional Shared-memory Parallel Applications on Clusters
PDP '10: Proceedings of the 2010 18th Euromicro Conference on Parallel, Distributed and Network-based ProcessingTransactional Memory is a novel, promising approach for simplifying parallel programming and increasing its acceptance and diffusion. Until now, almost all the research work on TM has been focused on shared-memory architectures, while very limited ...
Reducing Rollbacks of Transactional Memory Using Ordered Shared Locks
Euro-Par '09: Proceedings of the 15th International Euro-Par Conference on Parallel ProcessingTransactional Memory (TM) is a concurrency control mechanism that aims to simplify concurrent programming with reasonable scalability. Programmers can simply specify the code regions that access the shared data, and then a TM system executes them as ...
Comments