Geodesic
Method for distributed and consistent transactions execution
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 3 (2014) no. 3, pp. 37-50 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This paper proposes a method for detecting RW shared data conflicts, which encountered during execution of competitive set of distributed transactions. This method is designed to preventruntime anomalies associated with this type of conflicts in distributed transactional memorysystems.
Keywords: distributed transactional memory, partitioned global address space. 
@article{VYURV_2014_3_3_a2,
     author = {I. G. Danilov},
     title = {Method for distributed and consistent transactions execution},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a Vy\v{c}islitelʹna\^a matematika i informatika},
     pages = {37--50},
     year = {2014},
     volume = {3},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURV_2014_3_3_a2/}
}
TY  - JOUR
AU  - I. G. Danilov
TI  - Method for distributed and consistent transactions execution
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
PY  - 2014
SP  - 37
EP  - 50
VL  - 3
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VYURV_2014_3_3_a2/
LA  - ru
ID  - VYURV_2014_3_3_a2
ER  - 
%0 Journal Article
%A I. G. Danilov
%T Method for distributed and consistent transactions execution
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
%D 2014
%P 37-50
%V 3
%N 3
%U http://geodesic.mathdoc.fr/item/VYURV_2014_3_3_a2/
%G ru
%F VYURV_2014_3_3_a2
I. G. Danilov. Method for distributed and consistent transactions execution. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 3 (2014) no. 3, pp. 37-50. http://geodesic.mathdoc.fr/item/VYURV_2014_3_3_a2/

[1] M. Herlihy, J.E.B. Moss, “Transactional Memory: Architectural Support for Lock-Free Data Structures”, ACM SIGARCH Computer Architecture News, 21:2 (1993), 289–300 | DOI

[2] D.B. Lomet, “Process Structuring, Synchronization, and Recovery Using Atomic Actions”, ACM SIGOPS Operating Systems Review, 11:2 (1977), 128–137 | DOI

[3] B. Liskov, R. Scheifler, “Guardians and Actions: Linguistic Support for Robust, Distributed Programs”, ACM Transactions on Programming Languages and Systems (TOPLAS), 5:3 (1983), 381–404 | DOI

[4] C.A.R. Hoare, “Monitors: an Operating System Structuring Concept”, Communications of the ACM, 17:10 (1974), 549–557 | DOI

[5] M.M. Saad, B. Ravindran, “HyFlow: a High Performance Distributed Software Transactional Memory Framework”, Proceedings of the 20th International Symposium on High Performance Distributed Computing. HPDC '11, 2011, 265–266 | DOI

[6] M.M. Saad, B. Ravindran, Transactional Forwarding Algorithm: Technical Report, 2011, 11 pp.

[7] R.L. Bocchino, V.S. Adve, B.L. Chamberlain, “Software Transactional Memory for Large Scale Clusters”, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP '08, 2008, 247–258 | DOI

[8] G. Tel', Introduction to Distributed Algorithms, MCCME, Moscow, 2009, 616 pp.

[9] K.P. Eswaran, J.N. Gray, R.A. Lorie, I.L. Traiger, “The Notions of Consistency and Predicate Locks in a Database System”, Communications of the ACM, 19:11 (1976), 624–633 | DOI

[10] P.A. Bernstein, N. Goodman, “Concurrency Control in Distributed Database Systems”, ACM Computing Surveys (CSUR), 13:2 (1981), 185–221 | DOI

[11] D. Dice, O. Shalev, N. Shavit, “Transactional Locking II”, Proceedings of the 20th International Conference on Distributed Computing. DISC'06, 2006, 194–208 | DOI

[12] R. Guerraoui, M. Kapalka, “On the Correctness of Transactional Memory”, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP '08, 2008, 175–184 | DOI

[13] H.T. Kung, J.T. Robinson, “On Optimistic Methods for Concurrency Control”, ACM Transactions on Database Systems (TODS), 6:2 (1981), 213–226

[14] L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System”, Communications of the ACM, 21:7 (1978), 558–565 | DOI

[15] B. Zhang, B. Ravindran, “Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory”, Proceedings of the 13th International Conference on Principles of Distributed Systems. OPODIS '09, 2009, 48–53 | DOI

[16] S. Sridharan, J.S. Vetter, P.M. Kogge, Scalable Software Transactional Memory for Global Address Space Architectures: Technical Report. FTGTR-2009-04, Future Technologies Group, Oak Ridge National Lab, 2009

[17] S. Peluso, P. Ruivo, P. Romano, F. Quaglia, L. Rodrigues, “When Scalability Meets Consistency: Genuine Multiversion Update-Serializable Partial Data Replication”, IEEE 32nd International Conference on Distributed Computing Systems (ICDCS), 2012, 455–465 | DOI

[18] S. Peluso, P. Romano, F. Quaglia, “SCORe: a Scalable One-copy Serializable Partial Replication Protocol”, Proceedings of the 13th International Middleware Conference. Middleware '12, 2012, 456–475

[19] F. Mattern, “Virtual Time and Global States of Distributed Systems”, Proceedings Workshop on Parallel and Distributed Algorithms, ed. M. Cosnard, Elsevier Science, 1989, 215–226

[20] K. Manassiev, M. Mihailescu, C. Amza, “Exploiting Distributed Version Concurrency in a Transactional Memory Cluster”, Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP '06, 2006, 198–208 | DOI

[21] S. Mishra, A. Turcu, R. Palmieri, B. Ravindran, “HyflowCPP: A Distributed Transactional Memory Framework for C++”, 12th IEEE International Symposium on Network Computing and Applications (NCA), 2013, 219–226 | DOI

[22] M. Herlihy, Y. Sun, “Distributed Transactional Memory for Metric-space Networks”, Proceedings of the 19th International Conference on Distributed Computing. DISC'05, 2005, 324–338 | DOI

[23] I.G. Danilov, “DSTM_P1: Distributed Transactional Memory Prototype”, Proceedings of the 11th Conference on High Performance Computing (HPC, Nizhny Novgorod, November 2-3, 2011), ed. V.P. Gergel, Publishing of the Nizhny Novgorod State University, Nizhny Novgorod, 2011, 102–107

[24] I.G. Danilov, “On One Approach to Implement Software Transactional Memory for Distributed Computing”, IZVESTIYA SFedU. Series “Engineering Sciences”, 6(131), Thematic Issue of “Problems of Mathematical Modeling, Supercomputing and Information Technology” (2012), 91–95