TY - JOUR A1 - Beimler, Josef A1 - Leißl, Caroline A1 - Ebner, Lena A1 - Elsner, Michael A1 - Mühlbauer, Gerhard A1 - Kohlert, Dieter A1 - Schubert, Martin J. W. A1 - Weiß, Andreas P. A1 - Sterner, Michael A1 - Raith, Thomas A1 - Afranseder, Martin A1 - Krapf, Tobias A1 - Mottok, Jürgen A1 - Siemers, Christian A1 - Großmann, Benjamin A1 - Höcherl, Johannes A1 - Schlegl, Thomas A1 - Schneider, Ralph A1 - Milaev, Johannes A1 - Rampelt, Christina A1 - Roduner, Christian A1 - Glowa, Christoph A1 - Bachl, Christoph A1 - Schliekmann, Claus A1 - Gnan, Alfons A1 - Grill, Martin A1 - Ruhland, Karl A1 - Piehler, Thomas A1 - Friers, Daniel A1 - Wels, Harald A1 - Pflug, Kenny A1 - Kucera, Markus A1 - Waas, Thomas A1 - Schlachetzki, Felix A1 - Boy, Sandra A1 - Pemmerl, Josef A1 - Leis, Alexander A1 - Welsch, Andreas F.X. A1 - Graf, Franz A1 - Zenger, Gerhard A1 - Volbert, Klaus A1 - Waas, Thomas A1 - Scherzinger, Stefanie A1 - Klettke, Meike A1 - Störl, Uta A1 - Heyl, C. A1 - Boldenko, A. A1 - Monkman, Gareth J. A1 - Kujat, Richard A1 - Briem, Ulrich A1 - Hierl, Stefan A1 - Talbot, Sebastian A1 - Schmailzl, Anton A1 - Ławrowski, Robert Damian A1 - Prommesberger, Christian A1 - Langer, Christoph A1 - Dams, Florian A1 - Schreiner, Rupert A1 - Valentino, Piergiorgio A1 - Romano, Marco A1 - Ehrlich, Ingo A1 - Furgiuele, Franco A1 - Gebbeken, Norbert A1 - Eisenried, Michael A1 - Jungbauer, Bastian A1 - Hutterer, Albert A1 - Bauhuber, Michael A1 - Mikrievskij, Andreas A1 - Argauer, Monika A1 - Hummel, Helmut A1 - Lechner, Alfred A1 - Liebetruth, Thomas A1 - Schumm, Michael A1 - Joseph, Saskia A1 - Reschke, Michael A1 - Soska, Alexander A1 - Schroll-Decker, Irmgard A1 - Putzer, Michael A1 - Rasmussen, John A1 - Dendorfer, Sebastian A1 - Weber, Tim A1 - Al-Munajjed, Amir Andreas A1 - Verkerke, Gijsbertus Jacob A1 - Renkawitz, Tobias A1 - Haug, Sonja A1 - Rudolph, Clarissa A1 - Zeitler, Annika A1 - Schaubeck, Simon A1 - Steffens, Oliver A1 - Rechenauer, Christian A1 - Schulz-Brize, Thekla A1 - Fleischmann, Florian A1 - Kusterle, Wolfgang A1 - Beer, Anne A1 - Wagner, Bernd A1 - Neidhart, Thomas ED - Baier, Wolfgang T1 - Forschungsbericht 2013 T3 - Forschungsberichte der OTH Regensburg - 2013 Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-7990 CY - Regensburg ER - TY - CHAP A1 - Alfranseder, Martin A1 - Deubzer, Michael A1 - Justus, Benjamin A1 - Mottok, Jürgen A1 - Siemers, Christian T1 - An Efficient Spin-Lock Based Multi-Core Resource Sharing Protocol T2 - 33rd IEEE International Performance, Computing, and Communications Conference (IPCCC), Austin (TX), USA, 5-7 December 2014 N2 - We present in this paper a new lock-based resource sharing protocol PWLP (Preemptable Waiting Locking Protocol) for embedded multi-core processors. It is based on the busy-wait model and works with non-preemptive critical sections while task may be preempted by tasks with a higher priority when waiting for resources. Our protocol can be applied in partitioned as well as global scheduling scenarios, in which task-fix, job-fix or dynamically assigned priorities may be used. Furthermore, the PWLP permits nested requests to shared resources. Finally, we present a case study based on event-based simulations in which the FMLP (Flexible Multiprocessor Locking Protocol) and the proposed PWLP are compared. Y1 - 2014 U6 - https://doi.org/10.1109/PCCC.2014.7017090 ER - TY - CHAP A1 - Alfranseder, Martin A1 - Krapf, Tobias A1 - Mader, Ralph A1 - Niemetz, Michael A1 - Mottok, Jürgen A1 - Siemers, Christian T1 - An Efficient Partitioning Strategy for Runnables in Weakly Dependent Tasks on Embedded Multi-Core Systems T2 - Embedded real-time software and systems (ERTS² 2014), Feb 2014, Toulouse, France N2 - With multi-core controllers entering the area of automotive control ECUs, strategies for parallelizing the control- algorithms come into focus. This paper deals with a special part of automotive powertrain software, called state transitions. Since dependencies between runnables executed there are weak, the transitions provide a good basis for parallelization. We present a strategy of how to distribute efficiently the execution of runnables to different cores while taking care of inner and outer dependencies. The strategy is accompanied by two case studies demonstrating the performance of the concept. The first one is carried out to find the most efficient strategies of parallelize state transitions based on randomly generated, simulated state transitions. In the second one, the developed partitioning strategies are applied to a real software project for an automotive powertrain system. Y1 - 2014 ER - TY - CHAP A1 - Alfranseder, Martin A1 - Krapf, Tobias A1 - Mottok, Jürgen A1 - Siemers, Christian T1 - Synchronisationsverfahren in embedded Multicoresystemen T2 - Tagungsband, 6th Embedded Software Engineering, Kongress 2013, 2. bis 6. Dezembern 2013, Sindelfingen Y1 - 2013 PB - Vogel Business Media CY - Würzburg ER - TY - CHAP A1 - Lalo, Erjola A1 - Weber, Raphael A1 - Sailer, Andreas A1 - Mottok, Jürgen A1 - Siemers, Christian T1 - On Solving Task Allocation and Schedule Generation for Time-Triggered LET Systems using Constraint Programming T2 - 32nd International Conference on Architecture of Computing Systems, ARCS Workshop 2019, 20-21 May 2019, Copenhagen, Denmark N2 - The amount of safety-critical embedded systems in automotive development is heavily growing. Ensuring their reliability not only increases the complexity of functions but also requires determinism at design and execution time, which is considerably challenging to fulfill and verify for multi-core processors. The Logical Execution Time (LET) is recently recognized in automotive industry as an approach for ensuring deterministic functional behavior. However, to decrease the manual design effort and time for deploying such complex systems to multi-core platforms and for ensuring their strict timing and safety requirements, automatic solutions are needed. This work presents a solution for allocating tasks to multi-core processors and generating a time-triggered schedule for embedded systems considering safety, timing, and LET semantics. The approach we propose solves both challenges by defining them as a Constraint Satisfaction Problem (CSP). To examine our CSP formulation, we use MiniZinc, which is a solver-independent constraint modeling language that can employ a variety of solvers. In a case study, we explore optimizations of an industrial system that are enabled by scheduling and task allocation design decisions. Further, the performance of the proposed solutions is evaluated based on large set of synthetically generated system models. Y1 - 2019 UR - https://ieeexplore.ieee.org/abstract/document/8836201 SP - 1 EP - 8 ER - TY - CHAP A1 - Lalo, Erjola A1 - Sailer, Andreas A1 - Mottok, Jürgen A1 - Siemers, Christian T1 - Overhead-Aware Schedule Synthesis for Logical Execution Time (LET) in Automotive Systems T2 - 2022 IEEE 35th International System-on-Chip Conference (SOCC): 05-08 September 2022, Belfast, United Kingdom N2 - The Logical Execution Time (LET) has recently been integrated in multi-core automotive systems to ensure timing and dataflow determinism. Although buffering mechanisms are introduced to incorporate LET semantics, they do not guarantee that tasks are executed within their LET frames. In fact, LET and buffering semantics are violated if scheduling is not designed to execute all tasks within their LET frames and in a specific order. In this paper, we describe a scheduling synthesis technique for Fixed-Priority Scheduling (FPS) to achieve resource-efficient execution of LET systems. The proposed approach considers LET semantics, scheduling overheads, and delays caused by operating system operations and provides the possibility to optimize the schedule with respect to aspects like scheduling overheads. Our performance and feasibility evaluation shows that the proposed algorithm provides results in a reasonable amount of time for models of complex industrial applications. Thus, the integration of the proposed algorithm into an automated process is of high benefit to accelerate the development of vehicle applications. Y1 - 2022 SN - 978-1-6654-5985-3 U6 - https://doi.org/10.1109/SOCC56010.2022.9908103 SP - 1 EP - 6 PB - IEEE ER -