TY - GEN A1 - Ramsauer, Ralf A1 - Kiszka, Jan A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang T1 - Implementierung gemischt kritischer Systeme durch statische Hardwarepartitionierung T2 - Frühjahrstreffen der Fachgruppen Betriebssysteme, Hannover, 2. März 2018 Y1 - 2018 UR - https://www.betriebssysteme.org/wp-content/uploads/2018/04/fgbs18-169.pdf ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Safety, Security, Quality: Artificial Intelligence versus Common Sense T2 - Open Source Summit North America and Embedded Linux Conference North America 2020 Y1 - 2020 UR - https://www.youtube.com/watch?v=Ow_tMneQlH4 UR - https://elinux.org/images/7/7d/Wolfgang_Mauerer.pdf ER - TY - GEN A1 - Ramsauer, Ralf A1 - Kiszka, Jan A1 - Mauerer, Wolfgang T1 - Spectre and Meltdown vs. Real-Time: How Much do Mitigations Cost? T2 - Embedded Linux Conference Europe 2018, October 22 - 24, 2018, Edinburgh, UK Y1 - 2018 UR - https://www.youtube.com/watch?v=nqU4j2M_Ul4 ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Open Source in Research and Reality T2 - Open Source Summit North America and Embedded Linux Conference North America 2020 Y1 - 2020 UR - https://www.youtube.com/watch?v=L2iubyD1e7U ER - TY - GEN A1 - Ramsauer, Ralf A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang T1 - Quantifying Upstream Integration with PaStA T2 - LTSI Workshop @ ELC17 Y1 - 2017 ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Approaches to Ultra Long-Term System Maintenance T2 - Embedded Linux Conference Europe (Berlin), 2016 Y1 - 2016 UR - https://www.youtube.com/watch?v=SAbrQqSC61M ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Socio-Technical Aspects of Long Term Embedded Systems Maintenance T2 - Embedded Linux Conference, April 4-6, 2016, San Diego Y1 - 2016 ER - TY - GEN A1 - Mintel, Mario A1 - Ramsauer, Ralf A1 - Lohmann, Daniel A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Fork à la carte für In-Memory-Datenbanken T2 - Frühjahrstreffen der Fachgruppen Betriebssysteme, Hamburg, 17. März 2022 Y1 - 2022 UR - https://www.lfdr.de/Publications/2022/FGBS_Spring22_Mintel.pdf ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Ramsauer, Ralf A1 - Kölbl, Andreas T1 - The Many Approaches to Real-Time and Safety-Critical Linux T2 - Open Source Summit Japan 2017 Y1 - 2017 UR - http://events17.linuxfoundation.org/sites/events/files/slides/talk_10.pdf ER - TY - GEN A1 - Bielmeier, Benno A1 - Mauerer, Wolfgang T1 - Semi-Formal Verification of Embedded Linux Systems Using Trace-Based Models T2 - Semi-Formal Verification of Embedded Linux Systems Using Trace-Based Models Y1 - 2023 UR - https://www.lfdr.de/Publications/2022/bielmeier_ossj22.pdf UR - https://www.youtube.com/watch?v=w42ab8-CH1o ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Wagner, Daniel T1 - Cyclic Tests Unleashed: Large-Scale RT Analysis with Jitterdebugger T2 - Open Source Summit Japan (Tokio) and OSSNA 17.07.2019 Y1 - 2019 UR - https://events19.linuxfoundation.org/wp-content/uploads/2018/07/talk.pdf ER - TY - JOUR A1 - Schönberger, Manuel A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware JF - Proceedings of the ACM on Management of Data, PACMMOD N2 - The prospect of achieving computational speedups by exploiting quantum phenomena makes the use of quantum processing units (QPUs) attractive for many algorithmic database problems. Query optimisation, which concerns problems that typically need to explore large search spaces, seems like an ideal match for the known quantum algorithms. We present the first quantum implementation of join ordering, which is one of the most investigated and fundamental query optimisation problems, based on a reformulation to quadratic binary unconstrained optimisation problems. We empirically characterise our method on two state-of-the-art approaches (gate-based quantum computing and quantum annealing), and identify speed-ups compared to the best know classical join ordering approaches for input sizes that can be processed with current quantum annealers. However, we also confirm that limits of early-stage technology are quickly reached. Current QPUs are classified as noisy, intermediate scale quantum computers (NISQ), and are restricted by a variety of limitations that reduce their capabilities as compared to ideal future quantum computers, which prevents us from scaling up problem dimensions and reaching practical utility. To overcome these challenges, our formulation accounts for specific QPU properties and limitations, and allows us to trade between achievable solution quality and possible problem size. In contrast to all prior work on quantum computing for query optimisation and database-related challenges, we go beyond currently available QPUs, and explicitly target the scalability limitations: Using insights gained from numerical simulations and our experimental analysis, we identify key criteria for co-designing QPUs to improve their usefulness for join ordering, and show how even relatively minor physical architectural improvements can result in substantial enhancements. Finally, we outline a path towards practical utility of custom-designed QPUs. KW - Hardware KW - Quantum cmputation KW - Informations systems KW - Join algorithms Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-56634 N1 - Corresponding author: Manuel Schönberger VL - 1 IS - 1 SP - 1 EP - 27 PB - ACM CY - New York, NY, ER -