{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:30:43Z","timestamp":1777905043107,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1936450"],"award-info":[{"award-number":["CCF-1936450"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1016\/j.ic.2021.104700","type":"journal-article","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T16:54:33Z","timestamp":1610556873000},"page":"104700","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"PA","title":["Load balanced distributed directories"],"prefix":"10.1016","volume":"285","author":[{"given":"Shishir","family":"Rai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2021.104700_br0010","series-title":"SSS","first-page":"221","article-title":"Load balanced distributed directories","author":"Rai","year":"2018"},{"issue":"3","key":"10.1016\/j.ic.2021.104700_br0020","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00446-007-0037-x","article-title":"Distributed transactional memory for metric-space networks","volume":"20","author":"Herlihy","year":"2007","journal-title":"Distrib. Comput."},{"issue":"6","key":"10.1016\/j.ic.2021.104700_br0030","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/2.55500","article-title":"Directory-based cache coherence in large-scale multiprocessors","volume":"23","author":"Chaiken","year":"1990","journal-title":"Computer"},{"issue":"12","key":"10.1016\/j.ic.2021.104700_br0040","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TC.1978.1675013","article-title":"A new solution to coherence problems in multicache systems","volume":"27","author":"Censier","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ic.2021.104700_br0050","series-title":"Workshop on Scalable Shared Memory Multiprocessors","first-page":"239","article-title":"The mit alewife machine: a large-scale distributed-memory multiprocessor","author":"Agarwal","year":"1991"},{"key":"10.1016\/j.ic.2021.104700_br0060","series-title":"DISC","first-page":"119","article-title":"The arrow distributed directory protocol","author":"Demmer","year":"1998"},{"issue":"4","key":"10.1016\/j.ic.2021.104700_br0070","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/115994.116013","article-title":"Concurrent online tracking of mobile users","volume":"21","author":"Awerbuch","year":"1991","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"10.1016\/j.ic.2021.104700_br0080","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","article-title":"A tree-based algorithm for distributed mutual exclusion","volume":"7","author":"Raymond","year":"1989","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"10.1016\/j.ic.2021.104700_br0090","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s004460050028","article-title":"Software transactional memory","volume":"10","author":"Shavit","year":"1997","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104700_br0100","series-title":"ISCA","first-page":"289","article-title":"Transactional memory: architectural support for lock-free data structures","author":"Herlihy","year":"1993"},{"key":"10.1016\/j.ic.2021.104700_br0110","series-title":"Transactional Memory. Foundations, Algorithms, Tools, and Applications - COST Action Euro-TM IC1001","first-page":"367","article-title":"Directory protocols for distributed transactional memory","author":"Attiya","year":"2015"},{"key":"10.1016\/j.ic.2021.104700_br0120","series-title":"OPODIS","first-page":"48","article-title":"Brief announcement: Relay: a cache-coherence protocol for distributed transactional memory","author":"Zhang","year":"2009"},{"issue":"5","key":"10.1016\/j.ic.2021.104700_br0130","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00446-014-0214-7","article-title":"Distributed transactional memory for general networks","volume":"27","author":"Sharma","year":"2014","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104700_br0140","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.jpdc.2015.02.002","article-title":"A load balanced directory for distributed shared memory objects","volume":"78","author":"Sharma","year":"2015","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"10.1016\/j.ic.2021.104700_br0150","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(94)90158-9","article-title":"Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling","volume":"130","author":"Alon","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104700_br0160","series-title":"STOC","first-page":"386","article-title":"Universal approximations for tsp, steiner tree, and set cover","author":"Jia","year":"2005"},{"key":"10.1016\/j.ic.2021.104700_br0170","series-title":"SODA","first-page":"649","article-title":"Improved lower and upper bounds for universal tsp in planar metrics","author":"Hajiaghayi","year":"2006"},{"key":"10.1016\/j.ic.2021.104700_br0180","series-title":"APPROX\/RANDOM","first-page":"178","article-title":"Improved lower bounds for the universal and a priori tsp","author":"Gorodezky","year":"2010"},{"key":"10.1016\/j.ic.2021.104700_br0190","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.tcs.2015.05.006","article-title":"Optimal nearest neighbor queries in sensor networks","volume":"608","author":"Sharma","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104700_br0200","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs i","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publ. Math. (Debr.)"},{"issue":"5","key":"10.1016\/j.ic.2021.104700_br0210","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TC.2008.23","article-title":"Optimal oblivious path selection on the mesh","volume":"57","author":"Busch","year":"2008","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ic.2021.104700_br0220","series-title":"FOCS","first-page":"43","article-title":"Minimizing congestion in general networks","author":"R\u00e4cke","year":"2002"},{"issue":"2","key":"10.1016\/j.ic.2021.104700_br0230","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s00453-013-9803-2","article-title":"An analysis framework for distributed hierarchical directories","volume":"71","author":"Sharma","year":"2015","journal-title":"Algorithmica"},{"key":"10.1016\/j.ic.2021.104700_br0240","series-title":"DISC","first-page":"22:1","article-title":"Dynamic analysis of the arrow distributed directory protocol in general networks","author":"Ghodselahi","year":"2017"},{"issue":"4","key":"10.1016\/j.ic.2021.104700_br0250","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/964723.383071","article-title":"A scalable peer-to-peer lookup service for internet applications","volume":"31","author":"Stoica","year":"2001","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"4","key":"10.1016\/j.ic.2021.104700_br0260","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/964723.383072","article-title":"A scalable content-addressable network","volume":"31","author":"Ratnasamy","year":"2001","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.ic.2021.104700_br0270","series-title":"Middleware","first-page":"329","article-title":"Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems","author":"Rowstron","year":"2001"},{"issue":"1","key":"10.1016\/j.ic.2021.104700_br0280","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","article-title":"Tapestry: a resilient global-scale overlay for service deployment","volume":"22","author":"Zhao","year":"2006","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.ic.2021.104700_br0290","series-title":"SPAA","first-page":"247","article-title":"A data tracking scheme for general networks","author":"Rajaraman","year":"2001"},{"key":"10.1016\/j.ic.2021.104700_br0300","series-title":"SPAA","first-page":"311","article-title":"Accessing nearby copies of replicated objects in a distributed environment","author":"Plaxton","year":"1997"},{"key":"10.1016\/j.ic.2021.104700_br0310","series-title":"STOC","first-page":"281","article-title":"Bypassing the embedding: algorithms for low dimensional metrics","author":"Talwar","year":"2004"},{"key":"10.1016\/j.ic.2021.104700_br0320","series-title":"SODA","first-page":"798","article-title":"Navigating nets: simple algorithms for proximity search","author":"Krauthgamer","year":"2004"},{"issue":"5","key":"10.1016\/j.ic.2021.104700_br0330","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00446-014-0214-7","article-title":"Distributed transactional memory for general networks","volume":"27","author":"Sharma","year":"2014","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104700_br0340","series-title":"SODA","first-page":"970","article-title":"Oblivious network design","author":"Gupta","year":"2006"},{"key":"10.1016\/j.ic.2021.104700_br0350","series-title":"SODA","first-page":"770","article-title":"Improved steiner tree approximation in graphs","author":"Robins","year":"2000"},{"key":"10.1016\/j.ic.2021.104700_br0360","series-title":"STOC","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby","year":"1985"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0890540121000158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0890540121000158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:36:06Z","timestamp":1777638966000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540121000158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":36,"alternative-id":["S0890540121000158"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ic.2021.104700","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Load balanced distributed directories","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ic.2021.104700","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"104700"}}