Paweł T. Wojciechowski
ABSTRACT
The goal of this tool demo paper is to demonstrate the features of Atomic RMI 2, a system and tool for distributed programming in Java, extending the popular Java RMI system with support for distributed transactions. A distributed transaction can contain arbitrary code, including any operations on remote objects that must be executed atomically, consistently, and in isolation with respect to any other concurrent transactions. The Atomic RMI 2 package is released with an open source license.
- Atomic RMI 2. https://dsg.cs.put.poznan.pl/atomicrmi, 2016.Google Scholar
- P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley, 1987. Google ScholarDigital Library
- R. L. Bocchino, V. S. Adve, and B. L. Chamberlain. Software Transactional Memory for Large Scale Clusters. In Proceedings of PPoPP’08: the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Feb. 2008. Google ScholarDigital Library
- M. Couceiro, P. Romano, N. Carvalho, and L. Rodrigues. D2STM: Dependable distributed software transactional memory. In Proceedings of PRDC’13: the 15th IEEE Pacific Rim International Symposium on Dependable Computing, Nov. 2009. Google ScholarDigital Library
- R. Guerraoui and M. Kapałka. Principles of Transactional Memory. Morgan & Claypool, 2010.Google Scholar
- S. Hirve, R. Palmieri, and B. Ravindran. HiperTM: High performance, fault-tolerant transactional memory. In Proceedings of ICDCN’14: the 15th International Conference on Distributed Computing and Networking, Jan. 2014. Google ScholarDigital Library
- T. Kobus, M. Kokoci´nski, and P. T. Wojciechowski. Hybrid replication: State-machine-based and deferred-update replication schemes combined. In Proceedings of ICDCS’13: the 33rd International Conference on Distributed Computing Systems, July 2013. Google ScholarDigital Library
- C. Kotselidis, M. Ansari, K. Jarvis, M. Luján, C. C. Kirkham, and I. Watson. DiSTM: A software transactional memory framework for clusters. In Proceedings of ICPP’08: the 37th IEEE International Conference on Parallel Processing, Sept. 2008. Google ScholarDigital Library
- D. Peng and F. Dabek. Large-scale incremental processing using distributed transactions and notifications. In Proceedings of OSDI’10: the 9th USENIX Symposium on Operating Systems Design and Implementation, Oct. 2010. Google ScholarDigital Library
- M. M. Saad and B. Ravindran. HyFlow: A high performance distributed transactional memory framework. In Proceedings of HPDC’11: the 20th International Symposium on High Performance Distributed Computing, June 2011. Google ScholarDigital Library
- K. Siek and P. T. Wojciechowski. A formal design of a tool for static analysis of upper bounds on object calls in Java. In Proc. of FMICS ’12, LNCS 7437, 2012.Google ScholarCross Ref
- doi: 10.1007/978-3-642-32469-7_13. K. Siek and P. T. Wojciechowski. Last-use opacity: A strong safety property for transactional memory with early release support. June 2015. arXiv:1506.06275 {cs.DC} (submitted). K. Siek and P. T. Wojciechowski. Atomic RMI 2: Highly parallel pessimistic distributed transactional memory. May 2016.Google Scholar
- arXiv:1606.03928 {cs.DC} (submitted). A. Turcu, B. Ravindran, and R. Palmieri. HyFlow2: A high performance distributed transactional memory framework in Scala. In Proc. of PPPJ ’13, Sept. 2013. Google ScholarDigital Library
- P. T. Wojciechowski. Isolation-only transactions by typing and versioning. In Proc. of PPDP ’05, July 2005. Google ScholarDigital Library
Index Terms
- Atomic RMI 2: distributed transactions for Java
Recommendations
Atomic RMI: A Distributed Transactional Memory Framework
This paper presents Atomic RMI, a distributed transactional memory framework that supports the control flow model of execution. Atomic RMI extends Java RMI with distributed transactions that can run on many Java virtual machines located on different ...
Safe open-nested transactions through ownership
PPoPP '09Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore ``low-level'' memory operations of an open-nested transaction when detecting conflicts ...
Safe open-nested transactions through ownership
PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programmingResearchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore ``low-level'' memory operations of an open-nested transaction when detecting conflicts ...
Comments