{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:01Z","timestamp":1725664381917},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603689"},{"type":"electronic","value":"9783540455110"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60368-9_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:22:59Z","timestamp":1330280579000},"page":"381-398","source":"Crossref","is-referenced-by-count":2,"title":["A miss history-based architecture for cache prefetching"],"prefix":"10.1007","author":[{"given":"Vidyadhar","family":"Phalke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Gopinath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"T.F. Chen and J.L. Baer. Reducing memory latency via non-blocking and prefetching caches. ASPLOS-V, October 1992.","DOI":"10.1145\/143365.143486"},{"key":"17_CR2","unstructured":"Tien-Fu Chen. Data Prefetching for High-Performance Processors. PhD thesis, University of Washington Department of Computer Science and Engineering, July 1993."},{"key":"17_CR3","unstructured":"Edward G. Coffman and Peter J. Denning. Operating Systems Theory. Prentice-Hall, 1973."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"K.M. Curewitz, P. Krishnan, and J.S. Vitter. Practical prefetching via data compression. In Proceedings of 1993 ACM SIGMOD, June 1993.","DOI":"10.1145\/170035.170077"},{"key":"17_CR5","unstructured":"J.K. Flanagan, B. Nelson, J. Archibald, and K. Grimsrud. BACH: BYU address collection hardware; the collection of complete traces. In International Workshop on Modeling Techniques and Tools for Computer Performance Evaluation, September 1992."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"J.W.C. Fu and J.H. Patel. Data prefetching in multiprocessor vector cache memories. In Proceedings of the 18th Annual Symposium on Computer Architecture, pages 54\u201363, 1991.","DOI":"10.1145\/115952.115959"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"J.W.C. Fu and J.H. Patel. Stride directed prefetching in scalar processors. In Proceedings of the 25th International Symposium on Microarchitecture, pages 102\u2013110, 1992.","DOI":"10.1109\/MICRO.1992.697004"},{"key":"17_CR8","unstructured":"James Griffioen and Randy Appleton. Reducing file system latency using a predictive approach. In Proceedings of the Summer 1994 USENIX Conference, June 1994."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"I.J. Haikala. ARMA model of program behaviour. In Proceedings of Performance '86 and ACM SIGMETRICS 1986 Joint Conference on Computer Performance Modeling, Measurement and Evaluation, pages 170\u2013179, May 1986.","DOI":"10.1145\/317499.317550"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"J.L. Hennessy and N.P. Jouppi. Computer technology and architecture: An evolving interaction. IEEE Computer, 24, 1991.","DOI":"10.1109\/2.84896"},{"key":"17_CR11","unstructured":"John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufman, 1990."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"N.P. Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. In Proceedings of the 17th Annual Symposium on Computer Architecture, pages 364\u2013373, May 1990.","DOI":"10.1145\/325096.325162"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"A.C. Klaiber and H.M. Levy. An architecture for software-controlled data prefetching. In Proceedings of the 18th Annual Symposium on Computer Architecture, pages 43\u201353, 1991.","DOI":"10.1145\/115952.115958"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"T.C. Mowry, M.S. Lam, and Anoop Gupta. Design and evaluation of a compiler algorithm for prefetching. ASPLOS-V, October 1992.","DOI":"10.1145\/143365.143488"},{"key":"17_CR15","unstructured":"M. Palmer and S. Zdonik. Fido: A cache that learns to fetch. In Proceedings of 1991 International Conference on Very Large Databases, September 1991."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Vidyadhar Phalke and B. Gopinath. An inter-reference gap model for temporal locality in program behavior. In Proceedings of ACM SIGMETRICS 1995 Conference on Measurement and Modeling of Computer Systems, May 1995.","DOI":"10.1145\/223587.223620"},{"key":"17_CR17","unstructured":"Thomas R. Puzak. Analysis of Cache Replacement Algorithms. PhD thesis, University of Massachusetts Department of Electrical and Computer Engineering, February 1985."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Anne Rogers and Kai Li. Software support for speculative loads. ASPLOS-V, October 1992.","DOI":"10.1145\/143365.143484"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"I. Sklenar. Prefetch unit for vector operations on scalar computers. Computer Architecture News, 20(4), 1992.","DOI":"10.1145\/142880.142891"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"A.J. Smith. Sequential program prefetching in memory hierarchies. IEEE Computer, 12, December 1978.","DOI":"10.1109\/C-M.1978.218016"},{"key":"17_CR21","unstructured":"Insgik Song and Yookun Cho. Page prefetching based on fault history. In Proceedings of USENIX Mach III Symposium, 1993."},{"key":"17_CR22","first-page":"611","volume":"1","author":"J.R. Spirn","year":"1972","unstructured":"J.R. Spirn and P.J. Denning. Experiments with program locality. In Proceedings of AFIPS FJCC, volume 1, pages 611\u2013621, 1972.","journal-title":"Proceedings of AFIPS FJCC"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Dominique Thiebaut. On the fractal dimension of computer programs and it s application to the prediction of the cache miss ratio. IEEE Transactions on Computers, 38(7), July 1989.","DOI":"10.1109\/12.30852"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"J.S. Vitter and P. Krishnan. Optimal prefetching via data compression. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, October 1991.","DOI":"10.1109\/SFCS.1991.185360"}],"container-title":["Lecture Notes in Computer Science","Memory Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60368-9_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:44Z","timestamp":1605646724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60368-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603689","9783540455110"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60368-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}