Conferences  >  Informatics  >  Distributed, Edge and Cloud Computing  >  Germany

Entwickler.de Akademie

Das DevOps Service Mesh Camp ergänzt die bereits berühmte Reihe der DevOps Trainings mit den Kubernetes und Monitoring Camps und ist ein Must-Have, um auf Ihrem Weiterbildungsweg voranzukommen. Das dreitägige Intensivtraining findet vom 13. – 15. Mai 2024 in München statt. Lernen Sie Istio und dessen Features Schritt für Schritt kennen! Dabei geht Trainer Michael Hofmann immer wieder auf Best Practices und Security Best Parcices ein, um das Gelernte zu verdeutlichen. Sie können sich auf Live Codings und Hands-On Übungen freuen, durch die Sie Ihre neuen Kenntnisse praxisnah vertiefen.

Email: info@entwickler-akademie.de

DevOps, Istio, Workshop, Weiterbildung, Training, IT, Microservices, Cloud, Kubernetes, Programmieren

Training in Computer Science, Courses,    Software Engineering

Entwickler.de Akademie

In diesem Camp lernen Sie über drei Tage hinweg mittels Prometheus geschäftsrelevante Auswertungen umzusetzen und gezielte Ursachenanalyse zu betreiben. Anschließend erläutern Thomas und Karsten Schritt für Schritt, wie Sie für einen optimalen Überblick mit Hilfe von Grafana die gesammelten Metriken zu übersichtlichen Dashboards zusammenstellen.

Prometheus, Grafana, Metrikarten, PromQL, Monitoring, Datenbanken, Dev, Ops, Grundlagen

Software Engineering,    Training in Computer Science, Courses

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

In modern computational systems, the need to handle large-scale inputs imposes interesting computational challenges. Two such challenges are (1) the need to distribute the computation over multiple units, and (2) the dynamic nature of the input, which may undergo changes over time. A particular class of problems studied in these settings is when the input to the computational task is a huge graph. The field of dynamic graph algorithms addresses efficiently processing edge/vertex insertions/deletions in the input graph. In distributed graph algorithms, the input resides across multiple machines, and the goal is to solve the problem while minimizing the number of rounds of communication. Both of these rich research areas have been extensively studied since at least the 1980’s. We know of efficient algorithms for a large variety of tasks, such as shortest paths problems, coloring, subgraph finding, symmetry breaking, approximations, and many more. However, there are still fundamental problems with no known efficient solutions in some of these models, and even more where the exact complexity of computation is yet to be determined. In the recent years, a number of influential works show how transferring ideas from one of these models to the other provides progress on some of the long-lasting open problems. The goal of this Dagstuhl Seminar is to build a bridge between the two research communities of dynamic graph algorithms and distributed computing, by working together on joint research frontiers.

High Performance Computing, Supercomputing, Parallel Computing,    Scientific Computing and Data Science