{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:03:00Z","timestamp":1730275380685,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/ispan.2004.1300497","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T10:19:45Z","timestamp":1086862785000},"page":"307-312","source":"Crossref","is-referenced-by-count":1,"title":["Knowledge states for the caching problem in shared memory multiprocessor systems"],"prefix":"10.1109","author":[{"given":"W.W.","family":"Bein","sequence":"first","affiliation":[]},{"given":"L.L.","family":"Larmore","sequence":"additional","affiliation":[]},{"given":"R.","family":"Reischuk","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"38","article-title":"Trackless and Limited-Bookmark Algorithms for Paging","volume":"35","author":"bein","year":"2004","journal-title":"ACM SIGACT News"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1007\/3-540-58338-6_67"},{"key":"10","article-title":"Analyzing the competitive ratio of caching in multiprocessor systems","volume":"tr a 1 19","author":"genther","year":"2001","journal-title":"Technical Report"},{"key":"1","article-title":"The influence of lookahead in competitive paging algorithms","volume":"726","author":"albers","year":"1993","journal-title":"Proc European Symp Algorithms"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1007\/BFb0029565"},{"key":"6","first-page":"593","article-title":"On competitive on-line paging with lookahead","volume":"1046","author":"breslauer","year":"1996","journal-title":"Proc 10th Ann Symp Theoretical Aspects Comput Sci"},{"year":"1998","author":"borodin","journal-title":"Online Computation and Competitive Analysis","key":"5"},{"year":"0","author":"bein","journal-title":"Knowledge State Algorithms Randomization with Limited Information","key":"4"},{"key":"9","article-title":"Analyzing data access strategies in cache coherent architectures","volume":"tr a 9825","author":"genther","year":"1999","journal-title":"Technical Report"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1007\/PL00009248"},{"key":"11","first-page":"430","article-title":"Online binpacking with lookahead","author":"grove","year":"1995","journal-title":"Proc Symp Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1137\/S0097539796299540"}],"event":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","start":{"date-parts":[[2004,5,12]]},"location":"Hong Kong, China","end":{"date-parts":[[2004,5,12]]}},"container-title":["7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9103\/28881\/01300497.pdf?arnumber=1300497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T17:31:19Z","timestamp":1489426279000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1300497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ispan.2004.1300497","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}