Dmitrijs Zaparanuks

dblp:03/5286 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 6 · 5 first-author

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
Program analysis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
cost analysis
0.112012
Algorithmic profiling · PLDI 2012
Program analysis
dynamic analysis
0.112012
Algorithmic profiling · PLDI 2012
Program analysis › dynamic analysis
profiling
0.112012
Algorithmic profiling · PLDI 2012

Methods — techniques the papers use, named apart from their topics

input determination · 0.1cost measurement · 0.1cost function inference · 0.1
YearPublicationVenuePosition
2012 Algorithmic profiling
abstract
Traditional profilers identify where a program spends most of its resources. They do not provide information about why the program spends those resources or about how resource consumption would change for different program inputs. In this paper we introduce the idea of algorithmic profiling. While a traditional profiler determines a set of measured cost values, an algorithmic profiler determines a cost function. It does that by automatically determining the "inputs" of a program, by measuring the program's "cost" for any given input, and by inferring an empirical cost function.
Dmitrijs Zaparanuks, Matthias Hauswirth
PLDI1
2011 The Beauty and the Beast: Separating Design from Algorithm
Dmitrijs Zaparanuks, Matthias Hauswirth
ECOOP1
2011 Vision Paper: The Essence of Structural Models
Dmitrijs Zaparanuks, Matthias Hauswirth
MoDELS1
2011 Automated GUI performance testing
Andrea Adamoli, Dmitrijs Zaparanuks, Milan Jovic, Matthias Hauswirth
Softw. Qual. J.2
2010 Characterizing the design and performance of interactive java applications
abstract
When designers of Java runtime systems evaluate the performance of their systems for the purpose of running clientside Java applications, they normally use the Dacapo and SPEC JVM benchmark suites. However, when users of those Java runtime systems run client applications, they usually run interactive applications such as Eclipse or NetBeans. In this paper we study whether this mismatch is a problem: Do the prevalent Java client-side benchmark suites faithfully represent the characteristics of real-world Java client applications? To answer this question we characterize benchmarks and applications using three kinds of metrics: static metrics, architecture-independent dynamic metrics, and hardware performance counters. We find that real-world applications significantly differ from existing benchmarks. Our finding indicates that the current benchmark suites should be augmented to more faithfully represent the large segment of interactive applications.
Dmitrijs Zaparanuks, Matthias Hauswirth
ISPASS1
2009 Accuracy of performance counter measurements
abstract
Many experimental performance evaluations depend on accurate measurements of the cost of executing a piece of code. Often these measurements are conducted using infrastructures to access hardware performance counters. Most modern processors provide such counters to count micro-architectural events such as retired instructions or clock cycles. These counters can be difficult to configure, may not be programmable or readable from user-level code, and can not discriminate between events caused by different software threads. Various software infrastructures address this problem, providing access to per-thread counters from application code. This paper constitutes the first comparative study of the accuracy of three commonly used measurement infrastructures (perfctr, perfmon2, and PAPI) on three common processors (Pentium D, Core 2 Duo, and AMD ATHLON 64 X2).
Dmitrijs Zaparanuks, Milan Jovic, Matthias Hauswirth
ISPASS1