Richard Lewis Mattson (born May 29, 1935)[1] is an American computer scientist known for his pioneering work on using memory trace data to simulate the performance of the memory hierarchy.[2] He developed the stack distance profile, and used it to model page misses in virtual memory systems as a function of the amount of real memory available. The same methods have been applied as well more recently for modeling the behavior of CPU caches at lower levels of the memory hierarchy,[3][4] and of web caches for internet content.[5]
^Almási, George; Caşcaval, Cǎlin; Padua, David A. (June 2002), "Calculating Stack Distances Efficiently", Proceedings of the 2002 Workshop on Memory System Performance (MSP '02), SIGPLAN Notices, 38 (2S): 37–43, CiteSeerX10.1.1.586.7474, doi:10.1145/773039.773043
^Conte, T.M.; Hirsch, M.A.; Hwu, W.W. (1998), "Combining trace sampling with single pass methods for efficient cache simulations", IEEE Transactions on Computers, vol. C-47, IEEE, pp. 714–719, doi:10.1109/12.689650
^Fonseca, R.; Almeida, V.; Crovella, M.; Abrahao, B. (2003), "On the intrinsic locality properties of Web reference streams", Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2003), vol. 1, IEEE, pp. 448–458, CiteSeerX10.1.1.73.3153, doi:10.1109/infcom.2003.1208696, ISBN978-0-7803-7752-3, S2CID2688263