# From Monolithic to Cloud-Native

24.04.2020 von 14:00 bis 15:00

Cloud-Native technologies, and especially microservices are enjoying increasing popularity and diffusion in industrial environments, being adopted by several big players such as Amazon, LinkedIn, Netflix, and SoundCloud. Several patterns and platforms such as nginx (www.nginx.org) and Kubernetes (kubernetes.io) exist on the market. During the migration process, practitioners often face common problems, which are due mainly to their lack of knowledge regarding bad practices and patterns. In this session, we provide an introduction of microservices and serverless, reporting their issues and motivations, and describing the most common issues that companies usually postpone accumulating technical debt.

Short Bio: Davide Taibi is Associate Professor at the Tampere University (Finland) where he heads the Cloud and Web Engineering Group (CLoWeE). His research is mainly focused on Empirical Software Engineering applied to cloud-native systems, with a special focus on the migration from monolithic to cloud-native applications. He is investigating processes, and techniques for developing Cloud Native applications, identifying cloud-native specific patterns and anti-patterns. He is member of the International Software Engineering Network  (ISERN) from 2018. Before moving to Finland, he has been Assistant Professor at the Free University of Bozen/Bolzano (2015-2017), post-doctoral research fellow at the Technical University of Kaiserslautern and Fraunhofer Institute for Experimental Software Engineering - IESE (2013-2014) and research fellow at the University of Insubria (2007-2011).

# Reconstructing Words from Right-Bounded Binary Block Words

19.06.2020

A reconstruction problem of words from scattered factors asks for the minimal information, like multisets of scattered factors of a given length or the number of occurrences of scattered factors from a given set, necessary to uniquely determine a word. We show that a word $w\in\{a,b\}^*$ can be reconstructed from the number of occurrences of at most $\min(|w|_a,|w|_b)+1$ scattered factors of the form $a^i b$, where $|w|_a$ is the number of occurrences of the letter $a$ in $w$. Moreover, we generalize the result to alphabets of the form $\{1, \ldots, q\}$ by showing that at most $\sum_{i=1}^{q-1} |w|_i \, (q-i+1)$ scattered factors suffices to reconstruct $w$. Both results improve on the upper bounds known so far. Complexity time bounds on reconstruction algorithms are also considered here.