Note
You will find some of the content to be in German. If you are interested to get an English version or a summary of the content in English, let me know.
A wrap-up of the successful OpenTelemetry in Focus series for 2023, highlighting key discussions and community engagement throughout the year. Read the full article on OpenTelemetry Blog
While OpenTelemetry (OTel) is here to help you with troubleshooting and handling the “unknown unknowns”, it is also instrumental for managing route tasks like monitoring system metrics, like disk usage, server availability or SSL certificate expiration dates. This can be achieved by utilizing any one of the 90+ receivers available for the OpenTelemetry Collector, such as the Host Metrics Receiver or the HTTP Check Receiver. Read the full article on OpenTelemetry Blog ...
OpenTelemetry is here to help us find the root cause of issues in our software quickly. We recently had an issue that we were able to fix by using one feature of OpenTelemetry to identify the root cause of bug in another feature. Read the full article on OpenTelemetry Blog
Apache HTTP Server and NGINX are the most popular web servers. It’s most likely that you are using one of them in your application. In a previous blog post, you learned how to use the OpenTelemetry Module for Apache HTTP Server to add observability to Apache HTTP Server. In this blog post, you will learn how you can get observability for NGINX! Read the full article on OpenTelemetry Blog ...
In applications of symbolic computation an often required but complex procedure is the computation of Gröbner bases and hence it is obvious to realize parallel algorithms to compute them. There are parallel flavours of the F4 algorithm using the special structure of the occurring matrices to speed up the reduction. In this paper we start from this and present modifications allowing efficient computations of Gröbner bases on parallel architectures using shared as well as distributed memory. To achieve this we concentrate on one objective: reducing the memory consumption and avoiding communication overhead. We remove unrequired steps of the reduction, split the columns of the matrix in blocks for distribution and review the effectiveness of the SIMPLIFY function. Finally we provide benchmarks with up to 256 distributed threads of an implementation which will be available at https://github.com/svrnm/parallelGBC. ...
In this paper we provide an parallelization for the reduction of matrices for Gröbner basis computations advancing the ideas of using the special structure of the reduction matrix. First we decompose the matrix reduction in three steps allowing us to get a high parallelization for the reduction of the bigger part of the polynomials. In detail we do not need an analysis of the matrix to identify pivot columns, since they are obvious by construction and we give a rule set for the order of the reduction steps which optimizes the matrix transformation with respect to the parallelization. Finally we provide benchmarks for an implementation of our algorithm. This implementation is available as open source. ...
In dieser Arbeit wird ein neues Format für Schachendspieldatenbanken vorgestellt. Bei der Entwicklung wurde das Zusammenspiel der Indizierung und Kompression untersucht und optimiert. Als Kompressionsverfahren wurden Datacomp, GZip, BZip2, LZO und LZMA verwendet und verglichen. Read the full article on Informatiktage 2009