{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:18:53Z","timestamp":1779175133172,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf01762111","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:22:38Z","timestamp":1118917358000},"page":"79-119","source":"Crossref","is-referenced-by-count":415,"title":["Competitive snoopy caching"],"prefix":"10.1007","volume":"3","author":[{"given":"Anna R.","family":"Karlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark S.","family":"Manasse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Rudolph","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel D.","family":"Sleator","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01762111_CR1","unstructured":"Archibald, J., and Baer, J.-L. An evaluation of cache coherence solutions in shared-bus multiprocessors. Technical Report 85-10-05, Department of Computer Science, University of Washington, 1985."},{"key":"BF01762111_CR2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. A. Belady","year":"1966","unstructured":"Belady, L. A., A study of replacement algorithms for virtual storage computers.IBM Systems J.,5 78\u2013101, 1966.","journal-title":"IBM Systems J."},{"issue":"4","key":"BF01762111_CR3","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/3341.3349","volume":"28","author":"J. L. Bentley","year":"1985","unstructured":"Bentley, J. L., and McGeoch, C. C., Amortized analysis of self-organizing sequential search heuristics.Comm. ACM,28(4) 404\u2013411, 1985.","journal-title":"Comm. ACM"},{"issue":"1","key":"BF01762111_CR4","first-page":"164","volume":"57","author":"S. J. Frank","year":"1984","unstructured":"Frank, S. J., Tightly coupled multiprocessor system speeds memory access times.Electronics,57(1), 164\u2013169, 1984.","journal-title":"Electronics"},{"key":"BF01762111_CR5","doi-asserted-by":"crossref","unstructured":"Goodman, J. R. Using cache memory to reduce processor-memory traffic.Proc. 10th Annual IEEE International Symposium on Computer Architecture, pp. 124\u2013131, 1983.","DOI":"10.1145\/800046.801647"},{"key":"BF01762111_CR6","doi-asserted-by":"crossref","unstructured":"Katz, R., Eggers, S., Wood, D. A., Perkins, C., and Sheldon, R. G. Implementing a cache consistency protocol.Proc. 12th Annual IEEE International Symposium on Computer Architecture, pp. 276\u2013283, 1985.","DOI":"10.1145\/327070.327237"},{"key":"BF01762111_CR7","doi-asserted-by":"crossref","unstructured":"Papamarcos, M., and Patel, J. A low overhead coherence solution for multiprocessors with private cache memories.Proc. 11th Annual IEEE International Symposium on Computer Architecture, pp. 348\u2013354, 1984.","DOI":"10.1145\/800015.808204"},{"key":"BF01762111_CR8","doi-asserted-by":"crossref","unstructured":"Rudolph, L., and Segall, Z. Dynamic decentralized cache schemes for MIMD parallel processors.Proc. 11th Annual IEEE International Symposium on Computer Architecture, pp. 340\u2013347, 1984.","DOI":"10.1145\/800015.808203"},{"key":"BF01762111_CR9","unstructured":"Rudolph, L., and Segall, Z. Dynamic paging schemes for MIMD parallel processors. Technical Report, Computer Science Department, Carnegie-Mellon University, 1986."},{"issue":"2","key":"BF01762111_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"Sleator, D. D., and Tarjan, R. E., Amortized efficiency of list update and paging rules.Comm. ACM,28(2), 202\u2013208, 1985.","journal-title":"Comm. ACM"},{"key":"BF01762111_CR11","doi-asserted-by":"crossref","unstructured":"Vernon, M. K., and Holliday, M. A. Performance analysis of multiprocessor cache consistency protocols using generalized timed Petri nets. Technical Report, Computer Science Department, University of Wisconsin, 1986.","DOI":"10.1145\/317531.317534"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762111.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762111\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:26:50Z","timestamp":1586287610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":11,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01762111"],"URL":"https:\/\/doi.org\/10.1007\/bf01762111","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}