Svetozar Miucin

dblp:39/11029 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 first-authorSystems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 52% Performance modeling and evaluation · 48%
Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 50% Empirical software engineering · 50%

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

TopicWeightPapersLastEvidence papers
Empirical software engineering
developer studies
0.312018
Performance comprehension at WiredTiger · ESEC/SIGSOFT FSE 2018
Debugging and program repair
performance debugging
0.312018
Performance comprehension at WiredTiger · ESEC/SIGSOFT FSE 2018
Performance modeling and evaluation
profiling
0.212016
End-to-end memory behavior profiling with DINAMITE · SIGSOFT FSE 2016
Cloud and datacenter computing
cluster resource management and scheduling
0.112012
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012
Cloud and datacenter computing
resource allocation
0.112012
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012
Cloud and datacenter computing
virtualization
0.112012
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012
Performance modeling and evaluation › workload characterization
workload classification
0.112012
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012

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

qualitative study · 0.3trace analysis · 0.2dynamic instrumentation · 0.2workload signatures · 0.1caching · 0.1
YearPublicationVenuePosition
2018 Performance comprehension at WiredTiger
abstract
Software debugging is a time-consuming and challenging process. Supporting debugging has been a focus of the software engineering field since its inception with numerous empirical studies, theories, and tools to support developers in this task. Performance bugs and performance debugging is a sub-genre of debugging that has received less attention.
Alexandra Fedorova, Craig Mustard, Ivan Beschastnikh, Julia Rubin, Augustine Wong, Svetozar Miucin, Louis Ye
ESEC/SIGSOFT FSE6
2016 End-to-end memory behavior profiling with DINAMITE
abstract
Performance bottlenecks related to a program's memory behavior are common, yet very hard to debug. Tools that attempt to aid software engineers in diagnosing these bugs are typically designed to handle specific use cases; they do not provide information to comprehensively explore memory problems and to find solutions. Detailed traces of memory accesses would enable developers to ask various questions about the program's memory behaviour, but these traces quickly become very large even for short executions. We present DINAMITE: a toolkit for Dynamic INstrumentation and Analysis for MassIve Trace Exploration. DINAMITE instruments every memory access with highly debug information and provides a suite of extensible analysis tools to aid programmers in pinpointing memory bottlenecks.
Svetozar Miucin, Conor Brady, Alexandra Fedorova
SIGSOFT FSE1
2012 DejaVu: accelerating resource allocation in virtualized environments
abstract
Effective resource management of virtualized environments is a challenging task. State-of-the-art management systems either rely on analytical models or evaluate resource allocations by running actual experiments. However, both approaches incur a significant overhead once the workload changes. The former needs to re-calibrate and re-validate models, whereas the latter has to run a new set of experiments to select a new resource allocation. During the adaptation period, the system may run with an inefficient configuration. In this paper, we propose DejaVu - a framework that (1) minimizes the resource management overhead by identifying a small set of workload classes for which it needs to evaluate resource allocation decisions, (2) quickly adapts to workload changes by classifying workloads using signatures and caching their preferred resource allocations at runtime, and (3) deals with interference by estimating an "interference index". We evaluate DejaVu by running representative network services on Amazon EC2. DejaVu achieves more than 10x speedup in adaptation time for each workload change relative to the state-of-the-art. By enabling quick adaptation, DejaVu saves up to 60% of the service provisioning cost. Finally, DejaVu is easily deployable as it does not require any extensive instrumentation or human intervention.
Nedeljko Vasic, Dejan M. Novakovic, Svetozar Miucin, Dejan Kostic, Ricardo Bianchini
ASPLOS3