{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T05:18:22Z","timestamp":1779340702722,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T00:00:00Z","timestamp":1396483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00446-014-0214-7","type":"journal-article","created":{"date-parts":[[2014,4,2]],"date-time":"2014-04-02T10:27:27Z","timestamp":1396434447000},"page":"329-362","source":"Crossref","is-referenced-by-count":23,"title":["Distributed transactional memory for general networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Gokarna","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,3]]},"reference":[{"issue":"1","key":"214_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(94)90158-9","volume":"130","author":"N Alon","year":"1994","unstructured":"Alon, N., Kalai, G., Ricklin, M., Stockmeyer, L.J.: Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. Theor. Comput. Sci. 130(1), 175\u2013201 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"214_CR2","doi-asserted-by":"crossref","unstructured":"Ansari, M., Luj\u00e1n, M., Kotselidis, C., Jarvis, K., Kirkham, C., Watson, I.: Steal-on-abort: improving transactional memory performance through dynamic transaction reordering. In: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (HiPEAC), pp. 4\u201318 (2009)","DOI":"10.1007\/978-3-540-92990-1_3"},{"issue":"6","key":"214_CR3","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TSE.1984.5010293","volume":"10","author":"R Attar","year":"1984","unstructured":"Attar, R., Bernstein, P.A., Goodman, N.: Site initialization, recovery, and backup in a distributed database system. IEEE Trans. Softw. Eng. 10(6), 645\u2013650 (1984)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"214_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Gramoli, V., Milani, A.: A provably starvation-free distributed directory protocol. In: Proceedings of the 12th International Conference on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 405\u2013419 (2010)","DOI":"10.1007\/978-3-642-16023-3_33"},{"key":"214_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 268\u2013277 (1991)","DOI":"10.1109\/SFCS.1991.185378"},{"key":"214_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), vol. 2, pp. 503\u2013513 (1990)","DOI":"10.1109\/FSCS.1990.89571"},{"issue":"4","key":"214_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/115994.116013","volume":"21","author":"B Awerbuch","year":"1991","unstructured":"Awerbuch, B., Peleg, D.: Concurrent online tracking of mobile users. SIGCOMM Comput. Commun. Rev. 21(4), 221\u2013233 (1991)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"214_CR8","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"issue":"2","key":"214_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1006\/jagm.1996.0826","volume":"23","author":"Y Bartal","year":"1997","unstructured":"Bartal, Y., Rosen, A.: The distributed k-server problem: a competitive distributed translator for k-server algorithms. J. Algorithms 23(2), 241\u2013264 (1997)","journal-title":"J. Algorithms"},{"issue":"1","key":"214_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A., Karp, R., Tardos, G., Wigderson, A.: On the power of randomization in on-line algorithms. Algorithmica 11(1), 2\u201314 (1994)","journal-title":"Algorithmica"},{"key":"214_CR11","volume-title":"Concurrency Control and Recovery in Database Systems","author":"PA Bernstein","year":"1987","unstructured":"Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley Longman Publishing Co. Inc, Boston, MA (1987)"},{"key":"214_CR12","doi-asserted-by":"crossref","unstructured":"Bocchino, R.L., Adve, V.S., Chamberlain, B.L.: Software transactional memory for large scale clusters. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 247\u2013258 (2008)","DOI":"10.1145\/1345206.1345242"},{"key":"214_CR13","doi-asserted-by":"crossref","unstructured":"Couceiro, M., Romano, P., Carvalho, N., Rodrigues, L.: D2stm: dependable distributed software transactional memory. In: Proceedings of the 15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), pp. 307\u2013313 (2009)","DOI":"10.1109\/PRDC.2009.55"},{"key":"214_CR14","doi-asserted-by":"crossref","unstructured":"Demmer, M.J., Herlihy, M.: The arrow distributed directory protocol. In: Proceedings of the 12th International Symposium on Distributed Computing (DISC), pp. 119\u2013133 (1998)","DOI":"10.1007\/BFb0056478"},{"issue":"11","key":"214_CR15","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"214_CR16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"issue":"3","key":"214_CR17","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"214_CR18","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/12.88464","volume":"40","author":"MG Gouda","year":"1991","unstructured":"Gouda, M.G., Multari, N.J.: Stabilizing communication protocols. IEEE Trans. Comput. 40(4), 448\u2013458 (1991)","journal-title":"IEEE Trans. Comput."},{"key":"214_CR19","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 258\u2013264 (2005)","DOI":"10.1145\/1073814.1073863"},{"key":"214_CR20","unstructured":"Gupta, A.: Steiner points in tree metrics don\u2019t (really) help. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 220\u2013227 (2001)"},{"key":"214_CR21","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hajiaghayi, M.T., R\u00e4cke, H.: Oblivious network design. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 970\u2013979 (2006)","DOI":"10.1145\/1109557.1109665"},{"issue":"6","key":"214_CR22","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/MM.2004.91","volume":"24","author":"L Hammond","year":"2004","unstructured":"Hammond, L., Carlstrom, B.D., Wong, V., Chen, M., Kozyrakis, C., Olukotun, K.: Transactional coherence and consistency: simplifying parallel hardware and software. IEEE Micro 24(6), 92\u2013103 (2004)","journal-title":"IEEE Micro"},{"key":"214_CR23","unstructured":"Meyer auf der Heide, F., V\u00f6cking, B., Westermann, M.: Caching in networks (extended abstract). In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 430\u2013439 (2000)"},{"issue":"6","key":"214_CR24","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1007\/s00224-006-1251-9","volume":"39","author":"M Herlihy","year":"2006","unstructured":"Herlihy, M., Kuhn, F., Tirthapura, S., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. Theor. Comput. Syst. 39(6), 875\u2013901 (2006)","journal-title":"Theor. Comput. Syst."},{"key":"214_CR25","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N., III: Software transactional memory for dynamic-sized data structures. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing (PODC), pp. 92\u2013101 (2003)","DOI":"10.1145\/872035.872048"},{"issue":"2","key":"214_CR26","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/173682.165164","volume":"21","author":"M Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Arch. News 21(2), 289\u2013300 (1993)","journal-title":"SIGARCH Comput. Arch. News"},{"issue":"3","key":"214_CR27","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00446-007-0037-x","volume":"20","author":"M Herlihy","year":"2007","unstructured":"Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195\u2013208 (2007)","journal-title":"Distrib. Comput."},{"key":"214_CR28","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Tirthapura, S., Wattenhofer, R.: Competitive concurrent distributed queuing. In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 127\u2013133 (2001)","DOI":"10.1145\/383962.384001"},{"key":"214_CR29","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing (STOC), pp. 741\u2013750 (2002)","DOI":"10.1145\/509907.510013"},{"key":"214_CR30","doi-asserted-by":"crossref","unstructured":"Kotselidis, C., Ansari, M., Jarvis, K., Luj\u00e1n, M., Kirkham, C., Watson, I.: Distm: a software transactional memory framework for clusters. In: Proceedings of the 37th International Conference on Parallel Processing (ICPP), pp. 51\u201358 (2008)","DOI":"10.1109\/ICPP.2008.59"},{"key":"214_CR31","unstructured":"Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 798\u2013807 (2004)"},{"issue":"5","key":"214_CR32","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s00224-003-1085-7","volume":"36","author":"C Krick","year":"2003","unstructured":"Krick, C., R\u00e4cke, H., Westermann, M.: Approximation algorithms for data management in networks. Theor. Comput. Syst. 36(5), 497\u2013519 (2003)","journal-title":"Theor. Comput. Syst."},{"key":"214_CR33","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 294\u2013301 (2004)","DOI":"10.1145\/1007912.1007962"},{"issue":"4","key":"214_CR34","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"214_CR35","doi-asserted-by":"crossref","unstructured":"Maggs, B., auf der Heide, F.M., Voecking, B., Westermann, M.: Exploiting locality for data management in systems of limited bandwidth. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 284\u2013293 (1997)","DOI":"10.1109\/SFCS.1997.646117"},{"key":"214_CR36","doi-asserted-by":"crossref","unstructured":"Manassiev, K., Mihailescu, M., Amza, C.: Exploiting distributed version concurrency in a transactional memory cluster. In: Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 198\u2013208 (2006)","DOI":"10.1145\/1122971.1123002"},{"issue":"1","key":"214_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M Naimi","year":"1996","unstructured":"Naimi, M., Trehel, M., Arnold, A.: A log(n) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput. 34(1), 1\u201313 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"214_CR38","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s002240000118","volume":"32","author":"CG Plaxton","year":"1999","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. Theor. Comput. Syst. 32(3), 241\u2013280 (1999)","journal-title":"Theor. Comput. Syst."},{"key":"214_CR39","doi-asserted-by":"crossref","unstructured":"Rajaraman, R., Richa, A.W., V\u00f6cking, B., Vuppuluri, G.: A data tracking scheme for general networks. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 247\u2013254 (2001)","DOI":"10.1145\/378580.378670"},{"issue":"1","key":"214_CR40","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61\u201377 (1989)","journal-title":"ACM Trans. Comput. Syst."},{"key":"214_CR41","unstructured":"Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 770\u2013779 (2000)"},{"key":"214_CR42","doi-asserted-by":"crossref","unstructured":"Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 240\u2013248 (2005)","DOI":"10.1145\/1073814.1073861"},{"issue":"1\u20132","key":"214_CR43","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/s00453-011-9532-3","volume":"63","author":"G Sharma","year":"2012","unstructured":"Sharma, G., Busch, C.: A competitive analysis for balanced transactional memory workloads. Algorithmica 63(1\u20132), 296\u2013322 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"214_CR44","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s00446-012-0159-7","volume":"25","author":"G Sharma","year":"2012","unstructured":"Sharma, G., Busch, C.: Window-based greedy contention management for transactional memory: theory and practice. Distrib. Comput. 25(3), 225\u2013248 (2012)","journal-title":"Distrib. Comput."},{"key":"214_CR45","doi-asserted-by":"crossref","unstructured":"Sharma, G., Busch, C.: An analysis framework for distributed hierarchical directories. Algorithmica, Online First, pp. 1\u201332 (A preliminary version). In: Proceedings of the 14th International Conference on Distributed Computing and Networking (ICDCN), LNCS, vol. 7730, pp. 378\u2013392 (2013)","DOI":"10.1007\/978-3-642-35668-1_26"},{"key":"214_CR46","doi-asserted-by":"crossref","unstructured":"Sharma, G., Busch, C., Srinivasagopalan, S.: Distributed transactional memory for general networks. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1045\u20131056 (2012)","DOI":"10.1109\/IPDPS.2012.97"},{"issue":"2","key":"214_CR47","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput. 10(2), 99\u2013116 (1997)","journal-title":"Distrib. Comput."},{"key":"214_CR48","unstructured":"Sun, Y.: The ballistic protocol: Location-aware distributed cache coherence in metric-space networks. Ph. D. thesis, Brown University (2006)"},{"key":"214_CR49","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica 24, 573\u2013577 (1980)","journal-title":"Math. Japonica"},{"key":"214_CR50","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC), pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"},{"issue":"7","key":"214_CR51","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TPDS.2006.94","volume":"17","author":"S Tirthapura","year":"2006","unstructured":"Tirthapura, S., Herlihy, M.: Self-stabilizing distributed queuing. IEEE Trans. Parallel Distrib. Syst. 17(7), 646\u2013655 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"214_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: BA: Relay\u2014a cache-coherence protocol for distributed transactional memory. In: Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS), pp. 48\u201353 (2009)","DOI":"10.1007\/978-3-642-10877-8_6"},{"key":"214_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory. In: Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1\u201311 (2010)","DOI":"10.1109\/IPDPS.2010.5470393"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0214-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0214-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0214-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T07:06:35Z","timestamp":1746169595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0214-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,3]]},"references-count":53,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0214-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,3]]}}}