{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:44:31Z","timestamp":1743108271397,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_33","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"405-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A Provably Starvation-Free Distributed Directory Protocol"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]},{"given":"Alessia","family":"Milani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Chaiken, D., Kranz, D., Kubiatowicz, J., Kurihara, K., Maa, G., Nussbaum, D., Parkin, M., Yeung, D.: The MIT Alewife machine: A large-scale distributed-memory multiprocessor. In: Proceedings of Workshop on Scalable Shared Memory Multiprocessors (1991)","DOI":"10.1007\/978-1-4615-3604-8_13"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Simoni, R., Hennessy, J.L., Horowitz, M.: An evaluation of directory schemes for cache coherence. In: ISCA, pp. 280\u2013289 (1988)","DOI":"10.1145\/633625.52432"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Archibald, J.K., Baer, J.-L.: An economical solution to the cache coherence problem. In: ISCA, pp. 355\u2013362 (1984)","DOI":"10.1145\/773453.808205"},{"key":"33_CR4","unstructured":"Attiya, H., Gramoli, V., Milani, A.: Combine: An improved directory-based consistency protocol. Technical Report LPD-2010-002, EPFL (2010)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Bocchino, R.L., Adve, V.S., Chamberlain, B.L.: Software transactional memory for large scale clusters. In: PPoPP, pp. 247\u2013258 (2008)","DOI":"10.1145\/1345206.1345242"},{"issue":"12","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TC.1978.1675013","volume":"C-27","author":"L.M. Censier","year":"1978","unstructured":"Censier, L.M., Feautrier, P.: A new solution to coherence problems in multicache systems. IEEE Trans. on Comp.\u00a0C-27(12), 1112\u20131118 (1978)","journal-title":"IEEE Trans. on Comp."},{"issue":"6","key":"33_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/2.55500","volume":"23","author":"D. Chaiken","year":"1990","unstructured":"Chaiken, D., Fields, C., Kurihara, K., Agarwal, A.: Directory-based cache coherence in large-scale multiprocessors. Computer\u00a023(6), 49\u201358 (1990)","journal-title":"Computer"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Couceiro, M., Romano, P., Carvalho, N., Rodrigues, L.: D2STM: Dependable distributed software transactional memory. In: PRDC, pp. 307\u2013313 (2009)","DOI":"10.1109\/PRDC.2009.55"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0056478","volume-title":"Distributed Computing","author":"M. Demmer","year":"1998","unstructured":"Demmer, M., Herlihy, M.: The Arrow directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 119\u2013133. Springer, Heidelberg (1998)"},{"issue":"5","key":"33_CR10","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/060666202","volume":"38","author":"Y. Emek","year":"2008","unstructured":"Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. SIAM J. Comput.\u00a038(5), 1761\u20131781 (2008)","journal-title":"SIAM J. Comput."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Kuhn, F., Tirthapura, S., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. Theory of Computing Systems 39(6) (2006)","DOI":"10.1007\/s00224-006-1251-9"},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","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. Distributed Computing\u00a020(3), 195\u2013208 (2007)","journal-title":"Distributed Computing"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Tirthapura, S., Wattenhofer, R.: Competitive concurrent distributed queuing. In: PODC, pp. 127\u2013133 (2001)","DOI":"10.1145\/383962.384001"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"6","key":"33_CR15","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/2.55503","volume":"23","author":"D.V. James","year":"1990","unstructured":"James, D.V., Laundrie, A.T., Gjessing, S., Sohi, G.: Scalable coherent interface. Computer\u00a023(6), 74\u201377 (1990)","journal-title":"Computer"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Kruskal, C.P., Rudolph, L., Snir, M.: Efficient synchronization of multiprocessors with shared memory. In: PODC, pp. 218\u2013228 (1986)","DOI":"10.1145\/10590.10609"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. In: SPAA, pp. 294\u2013301 (2004)","DOI":"10.1145\/1007912.1007962"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Manassiev, K., Mihailescu, M., Amza, C.: Exploiting distributed version concurrency in a transactional memory cluster. In: PPoPP, pp. 198\u2013208 (2006)","DOI":"10.1145\/1122971.1123002"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Nussbaum, D., Agarwal, A.: Scalability of parallel machines. Commun. ACM (March 1991)","DOI":"10.1145\/102868.102871"},{"issue":"10","key":"33_CR20","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1109\/TC.1985.6312198","volume":"34","author":"G.F. Pfister","year":"1985","unstructured":"Pfister, G.F., Norton, V.A.: \u201chot spot\u201d contention and combining in multistage interconnection networks. IEEE Trans. on Comp.\u00a034(10), 943\u2013948 (1985)","journal-title":"IEEE Trans. on Comp."},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","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. TOCS\u00a07(1), 61\u201377 (1989)","journal-title":"TOCS"},{"key":"33_CR22","unstructured":"Sun, Y.: The Ballistic Protocol: Location-aware Distributed Cache Coherence in Metric-Space Networks. PhD thesis, Brown University (May 2006)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: Relay: A cache-coherence protocol for distributed transactional memory. In: OPODIS, pp. 48\u201353 (2009)","DOI":"10.1007\/978-3-642-10877-8_6"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:37:39Z","timestamp":1630726659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}