Demo Data from EDBT 2026 / reviewers in the wild / expert
Sam Prestwood
dblp:209/8676
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 50% Runtime systems and virtual machines · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
domain-specific compilation |
0.2 | 1 | 2016 | VizGen: accelerating visual computing prototypes in dynamic languages · ACM Trans. Graph. 2016 |
Runtime systems and virtual machines › dynamic compilation
dynamic language compilation |
0.2 | 1 | 2016 | VizGen: accelerating visual computing prototypes in dynamic languages · ACM Trans. Graph. 2016 |
Methods — techniques the papers use, named apart from their topics
type inference · 0.2program transformation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | VizGen: accelerating visual computing prototypes in dynamic languagesabstractThis paper introduces a novel domain-specific compiler, which translates visual computing programs written in dynamic languages to highly efficient code. We define "dynamic" languages as those such as Python and MATLAB, which feature dynamic typing and flexible array operations. Such language features can be useful for rapid prototyping, however, the dynamic computation model introduces significant overheads in program execution time. We introduce a compiler framework for accelerating visual computing programs, such as graphics and vision programs, written in generalpurpose dynamic languages. Our compiler allows substantial performance gains (frequently orders of magnitude) over general compilers for dynamic languages by specializing the compiler for visual computation. Specifically, our compiler takes advantage of three key properties of visual computing programs, which permit optimizations: (1) many array data structures have small, constant, or bounded size, (2) many operations on visual data are supported in hardware or are embarrassingly parallel, and (3) humans are not sensitive to small numerical errors in visual outputs due to changing floating-point precisions. Our compiler integrates program transformations that have been described previously, and improves existing transformations to handle visual programs that perform complicated array computations. In particular, we show that dependent type analysis can be used to infer sizes and guide optimizations for many small-sized array operations that arise in visual programs. Programmers who are not experts on visual computation can use our compiler to produce more efficient Python programs than if they write manually parallelized C, with fewer lines of application logic. Yuting Yang 0004, Sam Prestwood, Connelly Barnes |
ACM Trans. Graph. | 2 |