{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T06:49:44Z","timestamp":1673246984477},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T00:00:00Z","timestamp":1342742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10766-012-0200-2","type":"journal-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T13:51:12Z","timestamp":1342705872000},"page":"430-468","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Stack Distance Computation for a Class of Priority Replacement Policies"],"prefix":"10.1007","volume":"41","author":[{"given":"Gianfranco","family":"Bilardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kattamuri","family":"Ekanadham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratap","family":"Pattnaik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,20]]},"reference":[{"key":"200_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Alpern, B., Chandra, A., Snir, M.: A model for hierarchical memory. In: Proceedings of the 19th ACM Symposium on Theory of Computing, pp. 305\u2013314. ACM (May 1987)","DOI":"10.1145\/28395.28428"},{"key":"200_CR2","volume-title":"Optimizing Compilers for Modern Architectures","author":"R. Allen","year":"2002","unstructured":"Allen R., Kennedy K.: Optimizing Compilers for Modern Architectures. Morgan Kauffman, Los Altos, CA (2002)"},{"key":"200_CR3","doi-asserted-by":"crossref","unstructured":"Alm\u00e0 \u00e0si, G., Cascaval, C., Padua, D.: Calculating stack distances efficiently. In: Proceedings of ACM SIGPLAN Workshop on Memory Systems Performance, pp. 37\u201343. ACM (June 2002)","DOI":"10.1145\/773146.773043"},{"issue":"2","key":"200_CR4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. Belady","year":"1966","unstructured":"Belady L.: A study of replacement algorithms for a virtual-storage. IBM Syst. J. 5(2), 78\u2013101 (1966)","journal-title":"IBM Syst. J."},{"issue":"4","key":"200_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1147\/rd.194.0353","volume":"19","author":"B. Bennett","year":"1975","unstructured":"Bennett B., Kruskal V.: Lru stack processing. IBM J. Res. Dev. 19(4), 353\u2013357 (1975)","journal-title":"IBM J. Res. Dev."},{"key":"200_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/1552285.1552288","volume":"56","author":"G. Bilardi","year":"2009","unstructured":"Bilardi G., Ekanadham K., Pattnaik P.: On approximating the ideal random access machine by physical machines. J. ACM 56, 57 (2009)","journal-title":"J. ACM"},{"key":"200_CR7","unstructured":"Bilardi, G., Versaci, F.: An optimal policy for paging with stochastic inputs. Manuscript 1, 35 (2011)"},{"key":"200_CR8","doi-asserted-by":"crossref","unstructured":"Bohrer, P., Elnozahy, M., Gheith, A., Lefurgy, C., Nakra, T., Peterson, J., Rajamony, R., Rockhold, R., Shafi, H., Simpson, R., Speight, E., Sudeep, K., Hensbergen, E.V., Zhang, L.: Mambo a full system simulator for the powerpc architecture. In: ACM SIGMETRICS Performance Evaluation Review (2004)","DOI":"10.1145\/1054907.1054910"},{"key":"200_CR9","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1997","unstructured":"Cormen T., Leiserson C., Rivest R., Stein C.: Introduction to Algorithms. The MIT Press, Cambridge, MA (1997)"},{"key":"200_CR10","unstructured":"Fisherv, R.A., Yates, F.: Statistical Tables for Biological, Agricultural and Medical Research, 3rd edn. Oliver & Boyd, Edinburgh (Harlow, UK) [1938] (1948)"},{"issue":"10","key":"200_CR11","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/366786.366800","volume":"4","author":"J. Fotheringham","year":"1961","unstructured":"Fotheringham J.: Dynamic storage allocation in the atlas computer, including an automatic use of a backing store. Commun. ACM 4(10), 435\u2013436 (1961)","journal-title":"Commun. ACM"},{"issue":"1","key":"200_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321796.321800","volume":"21","author":"P.A. Franaszek","year":"1974","unstructured":"Franaszek P.A., Wagner T.J.: Some distribution-free aspects of paging algorithm performance. J. ACM 21(1), 31\u201339 (1974)","journal-title":"J. ACM"},{"key":"200_CR13","volume-title":"Computer Architecture: A Quantitative Approach","author":"J.L. Hennessy","year":"2006","unstructured":"Hennessy J.L., Patterson D.A.: Computer Architecture: A Quantitative Approach. Morgan Kauffman, Los Altos, CA (2006)"},{"key":"200_CR14","unstructured":"Knuth, D.J.: The Art of Computer Programming, vol. 2. Addison Wesley, Reading, MA [1969] (1998)"},{"key":"200_CR15","doi-asserted-by":"crossref","unstructured":"Lebeck, A.R., Wood, D.A.: Active memory: A new abstraction for memory-system simulation. In: Proceedings of 1993 ACM Sigmetrics Conference on Measurements and Modeling of Computer Systems, pp. 220\u2013230. ACM (May 1995)","DOI":"10.1145\/223586.223611"},{"issue":"12","key":"200_CR16","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/TC.2001.970573","volume":"50","author":"D. Lee","year":"2001","unstructured":"Lee D., Choi J., Kim J.-H., Noh S., Min S., Cho Y., Kim C.: Lrfu: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Comput. 50(12), 1352\u20131361 (2001)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"200_CR17","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.92.0078","volume":"9","author":"R. Mattson","year":"1970","unstructured":"Mattson R., Gecsei J., Slutz D., Traiger I.: Evaluation techniques for storage hierarchies. IBM Syst. J. 9(2), 78\u2013117 (1970)","journal-title":"IBM Syst. J."},{"key":"200_CR18","unstructured":"Moreira, J.: Load\/store characteristics for a set of power systems benchmarks. Technical Report RC25126, IBM Thomas J. Watson Research Center, Yorktown Heights (2011)"},{"issue":"8","key":"200_CR19","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/361532.361554","volume":"15","author":"P.H. Oden","year":"1972","unstructured":"Oden P.H., Shedler G.S.: A model of memory contention in a paging machine. Commun. ACM 15(8), 761\u2013771 (1972)","journal-title":"Commun. ACM"},{"issue":"1","key":"200_CR20","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/300515.300518","volume":"46","author":"E. O\u2019Neil","year":"1999","unstructured":"O\u2019Neil E., O\u2019Neil P., Weikum G.: An optimality proof of the lru-k page replacement algorithm. J. ACM 46(1), 92\u2013112 (1999)","journal-title":"J. ACM"},{"key":"200_CR21","volume-title":"Cache and Memory Hierarchy Design. A Performance Directed Approach","author":"S. Przybylski","year":"1990","unstructured":"Przybylski S.: Cache and Memory Hierarchy Design. A Performance Directed Approach. Morgan Kaufmann, Palo Alto, CA (1990)"},{"key":"200_CR22","volume-title":"Models of Computation. Exploring the Power of Computing","author":"J. Savage","year":"1997","unstructured":"Savage J.: Models of Computation. Exploring the Power of Computing. Addison-Wesley, Reading, MA (1997)"},{"key":"200_CR23","volume-title":"Operating System Concepts","author":"A. Silerschatz","year":"2005","unstructured":"Silerschatz A., Galvin P.B., Gagne G.: Operating System Concepts. Wiley, New York (2005)"},{"key":"200_CR24","doi-asserted-by":"crossref","unstructured":"Spirn, J.R., Denning, P.J.: Experiments with program locality. In: Proceedings of AFIPS \u201972 (Fall, part I), pp. 611\u2013621 (1972)","DOI":"10.1145\/1479992.1480078"},{"key":"200_CR25","doi-asserted-by":"crossref","unstructured":"Sugumar, R., Abraham, S.: Efficient simulation of caches under optimal replacement with application to miss characterization. In: Proceedings of 1993 ACM Sigmetrics Conference on Measurements and Modeling of Computer Systems, pp. 24\u201335. ACM (May 1993)","DOI":"10.1145\/166955.166974"},{"key":"200_CR26","volume-title":"High Performance Compilers for Parallel Computing","author":"M. Wolfe","year":"1995","unstructured":"Wolfe M.: High Performance Compilers for Parallel Computing. Addison-Wesley, Reading, MA (1995)"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-012-0200-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-012-0200-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-012-0200-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T08:20:29Z","timestamp":1561969229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-012-0200-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,20]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s10766-012-0200-2","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,20]]}}}