{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T05:18:01Z","timestamp":1779340681101,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,7,28]],"date-time":"2007-07-28T00:00:00Z","timestamp":1185580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2007,10,9]]},"DOI":"10.1007\/s00446-007-0037-x","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T08:24:26Z","timestamp":1185524666000},"page":"195-208","source":"Crossref","is-referenced-by-count":67,"title":["Distributed transactional memory for metric-space networks"],"prefix":"10.1007","volume":"20","author":[{"given":"Maurice","family":"Herlihy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,28]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Malkhi, D.: Lls: a locality aware location service for mobile ad hoc networks. In: DIALM-POMC, pp. 75\u201384 (2004)","DOI":"10.1145\/1022630.1022643"},{"key":"37_CR2","unstructured":"Abraham, I., Malkhi, D., Dobzinski, O.: Land: stretch ( $$1+\\epsilon$$ ) locality-aware networks for dhts. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 550\u2013559 (2004)"},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon N., Babai L. and Itai A. (1986). A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Alg. 7: 567\u2013583","journal-title":"J. Alg."},{"key":"37_CR4","unstructured":"Meyer auf der Heide, F., V\u00f6cking, B., Westermann, M.: Caching in networks (extended abstract). In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 430\u2013439 (2000)"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. In: STOC \u201993: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 164\u2013173 (1993)","DOI":"10.1145\/167088.167142"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Cowen, L.J., Smith, M.A.: Efficient asynchronous distributed symmetry breaking. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 214\u2013223 (1994)","DOI":"10.1145\/195058.195136"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Concurrent online tracking of mobile users. In: SIGCOMM \u201991: Proceedings of the Conference on Communications Architecture and Protocols, pp. 221\u2013233 (1991)","DOI":"10.1145\/115992.116013"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Fiat, A., Rabani, Y.: Competitive algorithms for distributed data management (extended abstract). In STOC \u201992: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 39\u201350. ACM Press (1992)","DOI":"10.1145\/129712.129717"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Demirbas, M., Arora, A., Nolte, T., Lynch, N.: A hierarchy-based fault-local stabilizing algorithm for tracking in sensor networks. In: 8th International Conference on Principles of Distributed Systems (OPODIS) (2004)","DOI":"10.1007\/11516798_22"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Demmer, M.J., Herlihy, M.P.: The arrow directory protocol. In: 12th International Symposium on Distributed Computing (1998)","DOI":"10.1007\/BFb0056478"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnewald, M., Meyer auf der Heide, F., Schindelhauer, C., Volbert, K.: Energy, congestion and dilation in radio networks. In: Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, 10-13 August 2002","DOI":"10.1145\/564870.564910"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: Proceedings of the 24th Annual Symposium on Principles of Distributed Computing (2005, to appear)","DOI":"10.1145\/1073814.1073863"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Hammond, L., Wong, V., Chen, M., Hertzberg, B., Carlstrom, B.D., Davis, J.D., Prabhu, M.K., Wijaya, H., Kozyrakis, C., Olukotun, K.: Transactional memory coherence and consistency. In: Proceedings of the 31st Annual International Symposium on Computer Architecture (2004)","DOI":"10.1109\/ISCA.2004.1310767"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Harris, T., Fraser, K.: Language support for lightweight transactions. In: Proceedings of the 18th ACM SIGPLAN Conference on Object-oriented Programing, Systems, Languages, and Applications, pp. 388\u2013402 (2003)","DOI":"10.1145\/949305.949340"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Harris, T., Marlow, S., Jones, S.P., Herlihy, M.: Composable memory transactions. In: Principles and Practice of Parallel Programming (2005, to appear)","DOI":"10.1145\/1065944.1065952"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDS), pp. 522\u2013529 (2003)","DOI":"10.1109\/ICDCS.2003.1203503"},{"key":"37_CR17","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 22 Annual Symposium on Principles of Distributed Computing, pp. 92\u2013101. ACM Press (2003)","DOI":"10.1145\/872035.872048"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Tirthapura, S., Wattenhofer, R.: Competitive concurrent distributed queuing. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 127\u2013133 (2001)","DOI":"10.1145\/383962.384001"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Herlihy, M.P., Tirthapura, S.: Self-stabilizing distributed queueing. In: Proceedings of 15th International Symposium on Distributed Computing (2001)","DOI":"10.1007\/3-540-45414-4_15"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Hildrum, K., Krauthgamer, R., Kubiatowicz, J.: Object location in realistic networks. In: Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 25\u201335 (2004)","DOI":"10.1145\/1007912.1007918"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, pp. 41\u201352 (2002)","DOI":"10.1145\/564870.564877"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Scherer, W.N., III, Scott, M.L.: Contention management in dynamic software transactional memory. In: PODC Workshop on Concurrency and Synchronization in Java Programs (2004)","DOI":"10.1145\/1073814.1073861"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 151\u2013160 (1994)","DOI":"10.1145\/197917.198079"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 741\u2013750. ACM Press (2002)","DOI":"10.1145\/509907.510013"},{"key":"37_CR25","unstructured":"Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: SODA \u201904: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 798\u2013807. Society for Industrial and Applied Mathematics (2004)"},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"Li, J., Jannotti, J., De Couto, D.S.J., Karger, D.R., Morris, R.: A scalable location service for geographic ad hoc routing. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 120\u2013130. ACM Press (2000)","DOI":"10.1145\/345910.345931"},{"issue":"4","key":"37_CR27","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/75104.75105","volume":"7","author":"K. Li","year":"1989","unstructured":"Li K. and Hudak P. (1989). Memory coherence in shared virtual memory systems. ACM Trans. Comput. Syst. 7(4): 321\u2013359","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"37_CR28","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/42392.42399","volume":"31","author":"B. Liskov","year":"1988","unstructured":"Liskov B. (1988). Distributed programming in argus. Commun. ACM 31(3): 300\u2013312","journal-title":"Commun. ACM"},{"issue":"4","key":"37_CR29","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby M. (1986). A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4): 1036\u20131055","journal-title":"SIAM J. Comput."},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Maggs, B., Meyer auf der Heide, F., V\u00f6cking, B., Westermann, M.: Exploiting locality for data management in systems of limited bandwidth. In: FOCS \u201997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 284\u2013293. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646117"},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"Marathe, V.J., Scherer, W.N., III, Scott, M.L.: Design tradeoffs in modern software transactional memory systems. In: 7th Workshop on Languages, Compilers, and Run-time Support for Scalable Systems (2004)","DOI":"10.1145\/1066650.1066660"},{"key":"37_CR32","doi-asserted-by":"crossref","unstructured":"Martfnez, J.F., Torrellas, J.: Speculative synchronization: applying thread-level speculation to explicitly parallel applications. In: Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), pp. 18\u201329. ACM Press (2002)","DOI":"10.1145\/605398.605400"},{"key":"37_CR33","doi-asserted-by":"crossref","unstructured":"Moir, M.: Practical implementations of non-blocking synchronization primitives. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 219\u2013228. ACM Press (1997)","DOI":"10.1145\/259380.259442"},{"key":"37_CR34","unstructured":"Ng, E., Zhang, H.: Predicting internet network distance with coordiantes-based approaches. In: Proceedings of IEEE Infocom. (2002)"},{"issue":"8","key":"37_CR35","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/2.84877","volume":"24","author":"B. Nitzberg","year":"1991","unstructured":"Nitzberg B. and Lo V. (1991). Distributed shared memory: a survey of issues and algorithms. Computer 24(8): 52\u201360","journal-title":"Computer"},{"key":"37_CR36","doi-asserted-by":"crossref","unstructured":"Oplinger, J., Lam, M.S.: Enhancing software reliability with speculative threads. In: Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), pp. 184\u2013196. ACM Press (2002)","DOI":"10.1145\/605397.605417"},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"37_CR38","doi-asserted-by":"crossref","unstructured":"Rajwar, R., Goodman, J.R.: Transactional lock-free execution of lock-based programs. In: Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), pp. 5\u201317. ACM Press (2002)","DOI":"10.1145\/605397.605399"},{"issue":"1","key":"37_CR39","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond K. (1989). A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1): 61\u201377","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"37_CR40","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"Ricart G. and Agrawala A.K. (1981). An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1): 9\u201317","journal-title":"Commun. ACM"},{"key":"37_CR41","doi-asserted-by":"crossref","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware (2001), pp. 329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"37_CR42","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pp. 204\u2013213. ACM Press (1995)","DOI":"10.1145\/224964.224987"},{"issue":"4","key":"37_CR43","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/88.260295","volume":"1","author":"J.M. Stone","year":"1993","unstructured":"Stone J.M., Stone H.S., Heidelberger P. and Turek J. (1993). Multiple reservations and the Oklahoma update. IEEE Parallel Distrib Technol 1(4): 58\u201371","journal-title":"IEEE Parallel Distrib Technol"},{"key":"37_CR44","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC \u201904: Proceedings of the 36th Annual ACM Symposium on Theory of computing, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"},{"key":"37_CR45","unstructured":"Waldo, J., Arnold, K. (eds.): The Jini Specifications. Jini Technology Series. Pearson Education (2000)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0037-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s00446-007-0037-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0037-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:36Z","timestamp":1559121996000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/s00446-007-0037-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,28]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,10,9]]}},"alternative-id":["37"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s00446-007-0037-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,28]]}}}