@article{DeubzerMottok, author = {Deubzer, Michael and Mottok, J{\"u}rgen}, title = {Dependability von Systemen mit dynamischen Multicore-Schedulingalgorithmen}, series = {safetronic}, journal = {safetronic}, language = {de} } @inproceedings{SchmidhuberDeubzerMottok, author = {Schmidhuber, Stefan and Deubzer, Michael and Mottok, J{\"u}rgen}, title = {Parallelisierte Echtzeitanalyse von Eingebetteten Systemen}, series = {Proceedings of the 4rd Embedded Software Engineering Congress (ESE), 5.-9. Dezember 2011, Sindelfingen}, booktitle = {Proceedings of the 4rd Embedded Software Engineering Congress (ESE), 5.-9. Dezember 2011, Sindelfingen}, pages = {516 -- 524}, language = {de} } @inproceedings{LaloDeubzerSchmidhuberetal., author = {Lalo, Erjola and Deubzer, Michael and Schmidhuber, Stefan and Oklapi, Erna and Mottok, J{\"u}rgen}, title = {Task Priority Optimization in Real-Time Multi-Core Embedded Systems}, series = {4. Landshuter Symposium Mikrosystemtechnik, Mikrosystemtechnik als Schl{\"u}sseltechnologie der Systemintegration, Tagungsband zum Symposium 12./13. M{\"a}rz 2014, Hochschule Landshut}, booktitle = {4. Landshuter Symposium Mikrosystemtechnik, Mikrosystemtechnik als Schl{\"u}sseltechnologie der Systemintegration, Tagungsband zum Symposium 12./13. M{\"a}rz 2014, Hochschule Landshut}, address = {Landshut}, isbn = {978-3-9812696-5-9}, pages = {96 -- 109}, abstract = {The shift from single-core to multi-core processors in real-time embedded systems leads to communication based effects on timing such as inter-core communication delays and blocking times. Moreover, the complexity of the scheduling problem increases when multi-core processors are used. In priority-based-scheduling, a fixed priority assignment is used in order to enable predictable behavior of the system. Predictability means that the system has to be analyzable which allows the detection of problems coming from scheduling decisions. For fixed priority scheduling in multi-core real-time embedded systems, a proper task priority assignment has to be done in a way that the system has minimal effects on timing. In this paper, we present an approach for finding near-optimal solutions for task priority assignment and the preemption/cooperation problem. A genetic algorithm is hereby used to create priority assignment solutions. A timing simulator is used for evaluation of each solution regarding real-time properties, memory consumption and communication overhead. In a case study we demonstrate that the proposed approach performs better than well known and single-core optimal heuristics for relatively complex systems.}, language = {de} } @inproceedings{AlfransederDeubzerJustusetal., author = {Alfranseder, Martin and Deubzer, Michael and Justus, Benjamin and Mottok, J{\"u}rgen and Siemers, Christian}, title = {An Efficient Spin-Lock Based Multi-Core Resource Sharing Protocol}, series = {33rd IEEE International Performance, Computing, and Communications Conference (IPCCC), Austin (TX), USA, 5-7 December 2014}, booktitle = {33rd IEEE International Performance, Computing, and Communications Conference (IPCCC), Austin (TX), USA, 5-7 December 2014}, doi = {10.1109/PCCC.2014.7017090}, abstract = {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.}, language = {en} } @inproceedings{HelmDeubzerMottok, author = {Helm, C. and Deubzer, Michael and Mottok, J{\"u}rgen}, title = {Analyse der Echtzeiteigenschaften von Multicore Speicherarchitekturen in Eingebetteten Systemen mittels einer konfigurierbaren Simulationssoftware}, series = {4. Landshuter Symposium Mikrosystemtechnik : Mikrosystemtechnik als Schl{\"u}sseltechnologie der Systemintegration, Tagungsband zum Symposium 12./13. M{\"a}rz 2014, Hochschule Landshut}, booktitle = {4. Landshuter Symposium Mikrosystemtechnik : Mikrosystemtechnik als Schl{\"u}sseltechnologie der Systemintegration, Tagungsband zum Symposium 12./13. M{\"a}rz 2014, Hochschule Landshut}, editor = {Ivanov, Artem and Bicker, Marc and Patzelt, Peter}, address = {Landshut}, isbn = {978-3-9812696-5-9}, pages = {109 -- 117}, language = {de} } @inproceedings{LaloSchmidhuberDeubzeretal., author = {Lalo, Erjola and Schmidhuber, Stefan and Deubzer, Michael and Mottok, J{\"u}rgen}, title = {Extended Task Priority and Preemptability Optimization in Real-Time Multi-Core Embedded Systems}, series = {4th Applied Research Conference, 5th July 2014, Ingolstadt}, booktitle = {4th Applied Research Conference, 5th July 2014, Ingolstadt}, address = {Ingolstadt}, isbn = {978-3-8440-2875-1}, pages = {90 -- 95}, language = {en} } @inproceedings{OklapiDeubzerSchmidhuberetal., author = {Oklapi, Erna and Deubzer, Michael and Schmidhuber, Stefan and Lalo, Erjola and Mottok, J{\"u}rgen}, title = {Optimization of Real-Time Multicore Systems Reached by a Genetic Algorithm Approach for Runnable Sequencing}, series = {2014 International Conference on Applied Electronics, Pilsen, Czech Republic}, booktitle = {2014 International Conference on Applied Electronics, Pilsen, Czech Republic}, doi = {10.1109/AE.2014.7011709}, pages = {233 -- 238}, abstract = {The deployment of complex real-time systems with everyday increasing demands and possibilities, is a challenging task for engineers when performance and efficiency have to be maximized while cost have to be minimized at the same time. For already designed systems it became necessary to perform different modifications in order to find optimal software architecture configuration by respecting all timing constraints which are essential when speaking of real-time systems. In this work, we present a model-based approach of optimizing the execution sequence of runnables within tasks in order to reduce the system's reaction times by improving the overall signal flow duration. Hereby, a genetic optimization algorithm is used to create and evaluate multiple solutions for the runnable sequencing problem. We conclude by demonstration the efficiency of the presented approach with experimental results.}, language = {en} } @inproceedings{OklapiDeubzerSchmidhuberetal., author = {Oklapi, Erna and Deubzer, Michael and Schmidhuber, Stefan and Mottok, J{\"u}rgen}, title = {Verification of an Evolutionary Optimization Algorithm for Runnable Sequencing Problem}, series = {4th Applied Research Conference, 5th July 2014, Ingolstadt}, booktitle = {4th Applied Research Conference, 5th July 2014, Ingolstadt}, language = {en} } @inproceedings{SailerSchmidhuberDeubzeretal., author = {Sailer, Andreas and Schmidhuber, Stefan and Deubzer, Michael and Alfranseder, Martin and Mucha, Matthias and Mottok, J{\"u}rgen}, title = {Optimizing the task allocation step for multi-core processors within autosar}, series = {2013 International Conference on Applied Electronics, IEEE, Pilsen, Czech Republic}, booktitle = {2013 International Conference on Applied Electronics, IEEE, Pilsen, Czech Republic}, abstract = {We present a model-based optimization approach for the task allocation problem in embedded multi-core systems. The information therefore is obtained from a system description in AUTOSAR and runtime measurements of the runnables in hardware traces. Based on this an initial software partitioning of runnables to tasks is created. We then use a genetic algorithm to create and evaluate solutions to the task allocation problem. Each solution is hereby evaluated using a discrete event-based simulation, which allows the evaluation with regard to real-time properties, resource consumption and data-communication overhead. The significance of our approach is then shown in a case-study. There, we optimize the task allocation of an embedded system, whose complexity is comparable to that of an actual system, on a multi-core processor. Finally, the results of the optimization are transferred to an ECU Configuration Description to enable further development in compliance with the AUTOSAR methodology.}, language = {en} } @inproceedings{MuchaMottokDeubzer, author = {Mucha, Matthias and Mottok, J{\"u}rgen and Deubzer, Michael}, title = {Probabilistic worst case response time estimation for multi-core real-time systems}, series = {2015 4th Mediterranean Conference on Embedded Computing (MECO), 14-18 June 2015, Budva, Montenegro}, booktitle = {2015 4th Mediterranean Conference on Embedded Computing (MECO), 14-18 June 2015, Budva, Montenegro}, pages = {31 -- 36}, abstract = {Traditional methods rely on Static Timing Analysis techniques to compute the Worst Case Response Time for tasks in real-time systems. Multi-Core real-time systems are faced up with concurrent task executions, semaphore accesses, and task migrations where it may be difficult to obtain the worst case upper bound. A new three staged probabilistic estimation concept is presented. Worst Case Response Times are estimated for tasksets which consist of tasks with multiple time bases. The concept involves data generation with sample classification and sample size equalization, model fit and Worst Case Response Time estimation on the basis of extreme value distribution models. A Generalized Pareto Distribution model fit method which includes threshold detection and parameter estimation is also presented. Sample classification in combination with the new Generalized Pareto Distribution model fit method allows to estimate Worst Case Response Times with low pessimism ranges compared to estimation methods that uses the Generalized Pareto or the Gumbel max distribution without sample classification.}, language = {en} }