T
Thomas VanDrunen
Researcher at Wheaton College (Illinois)
Publications - 11
Citations - 1782
Thomas VanDrunen is an academic researcher from Wheaton College (Illinois). The author has contributed to research in topics: Partial redundancy elimination & Java. The author has an hindex of 6, co-authored 11 publications receiving 1674 citations. Previous affiliations of Thomas VanDrunen include Purdue University.
Papers
More filters
Proceedings ArticleDOI
The DaCapo benchmarks: java benchmarking development and analysis
Stephen M. Blackburn,Robin Garner,Chris Hoffmann,Asjad M. Khang,Kathryn S. McKinley,Rotem Bentzur,Amer Diwan,Daniel Feinberg,Daniel Frampton,Samuel Z. Guyer,Martin Hirzel,Antony L. Hosking,Maria Jump,Han Lee,J. Eliot B. Moss,Aashish Phansalkar,Darko Stefanovic,Thomas VanDrunen,Daniel von Dincklage,Ben Wiedermann +19 more
TL;DR: This paper recommends benchmarking selection and evaluation methodologies, and introduces the DaCapo benchmarks, a set of open source, client-side Java benchmarks that improve over SPEC Java in a variety of ways, including more complex code, richer object behaviors, and more demanding memory system requirements.
Journal ArticleDOI
Wake up and smell the coffee: evaluation methodology for the 21st century
Stephen M. Blackburn,Kathryn S. McKinley,Robin Garner,Chris Hoffmann,Asjad M. Khan,Rotem Bentzur,Amer Diwan,Daniel Feinberg,Daniel Frampton,Samuel Z. Guyer,Martin Hirzel,Antony L. Hosking,Maria Jump,Han Lee,J. Eliot B. Moss,Aashish Phansalkar,Darko Stefanovik,Thomas VanDrunen,Daniel von Dincklage,Ben Wiedermann +19 more
TL;DR: The consequences of the authors' collective inattention to methodology on innovation are explored, recommendations for addressing this problem in one domain are made, and guidelines for other domains are provided.
Book ChapterDOI
Value-Based Partial Redundancy Elimination
TL;DR: A framework for thinking about expressions and values without source-level lexical constraints, a system of data-flow equations for determining insertion points, and a practical algorithm for extending a simple hash-based GVN for PRE are presented.
Proceedings ArticleDOI
The case for teaching functional programming in discrete math
TL;DR: The solution, advocated here, is to weave functional programming into the discrete mathematics course, which gives a convenient, early occasion to teach functional programming, but it also allows the functional programming topics and discrete mathematics topics to illuminate each other.
Reducing loads and stores in stack architectures
TL;DR: A generic family of transformations on Java-like bytecodes is formulated that replaces loads and stores of local variables with equivalent operation sequen ces that avoid the loads and Stores in favor of stack manipulation operations.