Jörg Domaschka

Dr. Jörg Domaschka

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2018
Verified
Conference Paper
Open access
DBDaniel Baur
Daniel Baur
DSDaniel Seybold
Daniel Seybold
FGFrank - Griesinger
Frank - Griesinger
HMHynek Masata
Hynek Masata
JDJörg Domaschka
Jörg Domaschka
Cloud computing and its computing as an utility paradigm provides on-demand resources allowing the seamless adaptation of applications to fluctuating demands. While the Cloud's ongoing commercialisation has lead to a vast provider landscape, vendor lock-in is still a major hindrance. Recent outages demonstrate that relying exclusively on one provider is not sufficient. While existing cloud orchestration tools promise to solve the problems by supporting deployments across multiple cloud providers, they typically rely on provider dependent models forcing prior knowledge of offers and obstructing flexibility in case of errors. We propose a cloud provider-agnostic application and resource description using a constraint language. It allows users to express resource requirements of an application without prior knowledge of existing offers. Additionally, we propose a discovery service automatically collecting available offers. We combine this with a matchmaking algorithm representing the discovery model and the user-given constraints in a constraint satisfaction problem (CSP) that is then solved. Finally, we manipulate this discovery model during runtime to react on errors. Our evaluation shows that using a constraint-based language is a feasible approach to the provider selection problem, and that it helps to overcome vendor lock-in.

5 April 2019
Verified
Conference Paper
Open access
PDF file
DSDaniel Seybold
Daniel Seybold
MKMoritz Keppler
Moritz Keppler
DGDaniel Gründler
Daniel Gründler
JDJörg Domaschka
Jörg Domaschka
Big Data and IoT applications require highly-scalable database management system (DBMS), preferably operated in the cloud to ensure scalability also on the resource level. As the number of existing distributed DBMS is extensive, the selection and operation of a distributed DBMS in the cloud is a challenging task. While DBMS benchmarking is a supportive approach, existing frameworks do not cope with the runtime constraints of distributed DBMS and the volatility of cloud environments. Hence, DBMS evaluation frameworks need to consider DBMS runtime and cloud resource constraints to enable portable and reproducible results. In this paper we present Mowgli, a novel evaluation framework that enables the evaluation of non-functional DBMS features in correlation with DBMS runtime and cloud resource constraints. Mowgli fully automates the execution of cloud and DBMS agnostic evaluation scenarios, including DBMS cluster adaptations. The evaluation of Mowgli is based on two IoT-driven scenarios, comprising the DBMSs Apache Cassandra and Couchbase, nine DBMS runtime configurations, two cloud providers with two different storage backends. Mowgli automates the execution of the resulting 102 evaluation scenarios, verifying its support for portable and reproducible DBMS evaluations. The results provide extensive insights into the DBMS scalability and the impact of different cloud resources. The significance of the results is validated by the correlation with existing DBMS evaluation results.

23 November 2022 in Future Generation Computer Systems
Verified
Journal Article
Closed access
SVSimon Volpert
Simon Volpert
PEPhilipp Eichhammer
Philipp Eichhammer
FHFlorian Held
Florian Held
THThomas Huffert
Thomas Huffert
HRHans P. Reiser
Hans P. Reiser
JDJörg Domaschka
Jörg Domaschka

15 April 2023
Verified
Conference Paper
Open access
SVSimon Volpert
Simon Volpert
BEBenjamin Erb
Benjamin Erb
GEGeorg Eisenhart
Georg Eisenhart
DSDaniel Seybold
Daniel Seybold
SWStefan Wesner
Stefan Wesner
JDJörg Domaschka
Jörg Domaschka

28 February 2015
Verified
Book Chapter
Closed access
PDF file
JDJörg Domaschka
Jörg Domaschka
KKKritikos Kiriakos
Kritikos Kiriakos
ARAlessandro Rossini
Alessandro Rossini

15 April 2023
Verified
Conference Paper
Open access
JDJörg Domaschka
Jörg Domaschka
SVSimon Volpert
Simon Volpert
KMKevin Maier
Kevin Maier
GEGeorg Eisenhart
Georg Eisenhart
DSDaniel Seybold
Daniel Seybold
Database management systems~(DBMS) are crucial architectural components of any modern distributed software system. Yet, ensuring a smooth, high-performant operation of a DBMS is a black art that requires tweaking many knobs and is heavily dependent on the experienced workload. Misconfigurations at production systems have an heavy impact on the overall delivered service quality and hence, should be avoided at all costs. Replaying production workload on test and staging systems to estimate the ideal configuration are a valid approach. Yet, this requires traces from the production systems. While many DBMS's have built-in support to capture such traces these have a non-negligible impact on performance. eBPF is a Linux kernel feature claiming to enable low-overhead observability and application tracing. In this paper, we evaluate different eBPF-based approaches to DBMS workload tracing for PostgreSQL and MySQL. The results show that using eBPF causes lower overhead than the built-in mechanisms. Hence, eBPF can be a viable baseline for building a generic tracing framework. Yet, our current results also show that additional optimisation and fine-tuning is needed to further lower the performance overhead.