Jump to content

Richard Mattson

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Citation bot (talk | contribs) at 01:36, 29 November 2023 (Alter: pages, url. URLs might have been anonymized. Formatted dashes. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 1174/2500). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]

Mattson was born in Greeley, Colorado.[1] He graduated from the University of California, Berkeley in 1957, with honors in electrical engineering.[6] He became a student of Bernard Widrow at Stanford University, where he completed his doctorate in 1962. His dissertation was The Analysis and Synthesis of Adaptive Systems Which Use Networks of Threshold Elements.[7] He then became a faculty member at Stanford himself, before moving to IBM Research in 1965.[8] While at Stanford, he supervised two doctoral students, John Hopcroft and Yale Patt, both of whom themselves became notable computer scientists, and he has many academic descendants through both of them.[7]

References

[edit]
  1. ^ a b American Men & Women of Science, Volume 5, Thomson/Gale, 2009, p. 285
  2. ^ Eggers, S.J.; Lazowska, E.D.; Lin, Yi-Bing (1989), "Techniques For The Trace-Driven Simulation Of Cache Performance", 1989 Winter Simulation Conference Proceedings, IEEE, pp. 1042–1046, doi:10.1109/wsc.1989.718790, ISBN 978-0-911801-58-3, S2CID 53234699
  3. ^ 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, CiteSeerX 10.1.1.586.7474, doi:10.1145/773039.773043
  4. ^ 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
  5. ^ 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, CiteSeerX 10.1.1.73.3153, doi:10.1109/infcom.2003.1208696, ISBN 978-0-7803-7752-3, S2CID 2688263
  6. ^ The Ninety-Fourth Commencement, University of California, Berkeley, June 7, 1957, p. 141
  7. ^ a b Richard Mattson at the Mathematics Genealogy Project
  8. ^ "Authors", IBM Systems Journal, 9 (2): 159, 1970, doi:10.1147/sj.92.0159