Pascal Muoka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pascal Muoka has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Onwuchekwa
Chair of Embedded Systems, University of Siegen, Hölderlinstraße 3, 57076 Siegen, Germany
4 shared publications - Roman Obermaisser
Department of Electrical Engineering and Computer Science, University of Siegen, 57076 Siegen, Germany
4 shared publications - Ala Khalifeh
German Jordanian University, Amman, Jordan
1 shared publication - Haytham Baniabdelghany
Faculty of Science and Technology, University of Siegen, Siegen, Germany
1 shared publication - Oghenemaro Umuomo
University of Siegen
1 shared publication Rakotojaona Nambinina
Chair for Embedded Systems University of Siegen,Siegen,Germany
1 shared publication
Latest Publications
- 17 September 2024
- Published by Springer Nature
- p. 117-133
Adaptive Hierarchical Meta-Scheduling for Distributed Time-Triggered Systems with Diverse Internal and System Architectures
- 17 September 2024
- Published by Springer Nature
- p. 117-133
Adaptive Hierarchical Meta-Scheduling for Distributed Time-Triggered Systems with Diverse Internal and System Architectures
- 29 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Adaptive Time-Triggered Network-on-Chip Architecture: Enhancing Safety
Real-time computing systems are designed to meet strict timing constraints and respond to events or inputs within specific deadlines. These systems are commonly used in safety-critical applications such as spacecraft, medical devices, industrial control, and automotive systems. Engineers rely on various scheduling techniques to ensure that timing constraints are met. One such technique is static allocation in time-triggered systems. This technique offers valuable advantages in terms of system safety and dependability. It enables efficient resource usage in Network-on-Chip (NoC) architectures by minimizing message congestion and contention. However, its static nature can present limitations in terms of fault tolerance. This paper focuses on developing and evaluating fault tolerance techniques tailored for NoC-based multi-core architectures to enhance safety. It introduces adaptation techniques that tolerate permanent faults within the time-triggered NoC architecture. Additionally, the paper outlines the incorporation of seamless redundancy mechanisms at the network interface (NI) level, specifically designed to tolerate transient faults that may occur within NoC components, such as routers and links. These mechanisms play a crucial role in safeguarding critical data, further enhancing the reliability and safety of real-time systems in safety-critical applications.
- 29 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Adaptive Time-Triggered Network-on-Chip Architecture: Enhancing Safety
Real-time computing systems are designed to meet strict timing constraints and respond to events or inputs within specific deadlines. These systems are commonly used in safety-critical applications such as spacecraft, medical devices, industrial control, and automotive systems. Engineers rely on various scheduling techniques to ensure that timing constraints are met. One such technique is static allocation in time-triggered systems. This technique offers valuable advantages in terms of system safety and dependability. It enables efficient resource usage in Network-on-Chip (NoC) architectures by minimizing message congestion and contention. However, its static nature can present limitations in terms of fault tolerance. This paper focuses on developing and evaluating fault tolerance techniques tailored for NoC-based multi-core architectures to enhance safety. It introduces adaptation techniques that tolerate permanent faults within the time-triggered NoC architecture. Additionally, the paper outlines the incorporation of seamless redundancy mechanisms at the network interface (NI) level, specifically designed to tolerate transient faults that may occur within NoC components, such as routers and links. These mechanisms play a crucial role in safeguarding critical data, further enhancing the reliability and safety of real-time systems in safety-critical applications.
- 11 June 2023
- Published by Springer Nature
- p. 28-40
Adaptation for Energy Saving in Time-Triggered Systems Using Meta-scheduling with Sample Points
- 11 June 2023
- Published by Springer Nature
- p. 28-40
Adaptation for Energy Saving in Time-Triggered Systems Using Meta-scheduling with Sample Points
- 6 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (14) , 12666-12675
Metascheduling Using Discrete Particle Swarm Optimization for Fault Tolerance in Time-Triggered IoT-WSN
In time-triggered (TT) systems, adaptation is performed by using metascheduling approaches to ensure temporal predictability. Wireless sensor networks (WSNs) are growing to be used as a reliable, an energy efficient, and a scalable network infrastructure for numerous Internet of Things (IoT) applications. Because of run-time changes because of failure events, a metascheduling system is required to address the changes by precomputing schedules for several context events at design time. Therefore, this article proposes a metascheduler that solves a new scheduling problem for each adaptation scenario in IoT-WSN using our offline algorithm named discrete particle swarm optimization for reliable task allocation (DPSO-TA), resulting in a multischedule graph (MSG) that combines the repeated schedules. In this work, a TT IoT-WSN metascheduler is proposed that takes into considerations the node or link failures that are common in WSN. Single- and two-failure events are considered, where a graph for all feasible schedules is formed at the network design time. Such a large number of schedules causes a state space explosion problem, which is managed using a reconvergence method. Different application model sizes and network topologies are used to assess the proposed metascheduler under various failure event scenarios. The results show a reduction in the size of the MSG by applying inputs with different deadline values and different number of tasks. Furthermore, the validity suggested by the proposed metascheduler, which is the ratio of valid to invalid schedules, is improved when compared to algorithms that schedule tasks to hosts with the shortest completion time or algorithms that select hosts for a set of sorted tasks based on energy consumed and task arrival time.
- 6 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (14) , 12666-12675
Metascheduling Using Discrete Particle Swarm Optimization for Fault Tolerance in Time-Triggered IoT-WSN
In time-triggered (TT) systems, adaptation is performed by using metascheduling approaches to ensure temporal predictability. Wireless sensor networks (WSNs) are growing to be used as a reliable, an energy efficient, and a scalable network infrastructure for numerous Internet of Things (IoT) applications. Because of run-time changes because of failure events, a metascheduling system is required to address the changes by precomputing schedules for several context events at design time. Therefore, this article proposes a metascheduler that solves a new scheduling problem for each adaptation scenario in IoT-WSN using our offline algorithm named discrete particle swarm optimization for reliable task allocation (DPSO-TA), resulting in a multischedule graph (MSG) that combines the repeated schedules. In this work, a TT IoT-WSN metascheduler is proposed that takes into considerations the node or link failures that are common in WSN. Single- and two-failure events are considered, where a graph for all feasible schedules is formed at the network design time. Such a large number of schedules causes a state space explosion problem, which is managed using a reconvergence method. Different application model sizes and network topologies are used to assess the proposed metascheduler under various failure event scenarios. The results show a reduction in the size of the MSG by applying inputs with different deadline values and different number of tasks. Furthermore, the validity suggested by the proposed metascheduler, which is the ratio of valid to invalid schedules, is improved when compared to algorithms that schedule tasks to hosts with the shortest completion time or algorithms that select hosts for a set of sorted tasks based on energy consumed and task arrival time.
- Open Access
- 24 December 2021
- Published by MDPI AG in Electronics
- Vol. 11 (1) , 49
Adaptive Scheduling for Time-Triggered Network-on-Chip-Based Multi-Core Architecture Using Genetic Algorithm
Adaptation in time-triggered systems can be motivated by energy efficiency, fault recovery, and changing environmental conditions. Adaptation in time-triggered systems is achieved by preserving temporal predictability through metascheduling techniques. Nevertheless, utilising existing metascheduling schemes for time-triggered network-on-chip architectures poses design time computation and run-time storage challenges for adaptation using the resulting schedules. In this work, an algorithm for path reconvergence in a multi-schedule graph, enabled by a reconvergence horizon, is presented to manage the state-space explosion problem resulting from an increase in the number of scenarios required for adaptation. A meta-scheduler invokes a genetic algorithm to solve a new scheduling problem for each adaptation scenario, resulting in a multi-schedule graph. Finally, repeated nodes of the multi-schedule graph are merged, and further exploration of paths is terminated. The proposed algorithm is evaluated using various application model sizes and different horizon configurations. Results show up to 56% reduction of schedules necessary for adaptation to 10 context events, with the reconvergence horizon set to 50 time units. Furthermore, 10 jobs with 10 slack events and a horizon of 40 ticks result in a average sleep time for energy savings. Furthermore, the results demonstrate the reduction in the state-space size while showing the trade-off between the size of the reconvergence horizon and the number of nodes of the multi-schedule graph.- 24 December 2021
- Published by MDPI AG in Electronics
- Vol. 11 (1) , 49
Open AccessAdaptive Scheduling for Time-Triggered Network-on-Chip-Based Multi-Core Architecture Using Genetic Algorithm
Adaptation in time-triggered systems can be motivated by energy efficiency, fault recovery, and changing environmental conditions. Adaptation in time-triggered systems is achieved by preserving temporal predictability through metascheduling techniques. Nevertheless, utilising existing metascheduling schemes for time-triggered network-on-chip architectures poses design time computation and run-time storage challenges for adaptation using the resulting schedules. In this work, an algorithm for path reconvergence in a multi-schedule graph, enabled by a reconvergence horizon, is presented to manage the state-space explosion problem resulting from an increase in the number of scenarios required for adaptation. A meta-scheduler invokes a genetic algorithm to solve a new scheduling problem for each adaptation scenario, resulting in a multi-schedule graph. Finally, repeated nodes of the multi-schedule graph are merged, and further exploration of paths is terminated. The proposed algorithm is evaluated using various application model sizes and different horizon configurations. Results show up to 56% reduction of schedules necessary for adaptation to 10 context events, with the reconvergence horizon set to 50 time units. Furthermore, 10 jobs with 10 slack events and a horizon of 40 ticks result in a average sleep time for energy savings. Furthermore, the results demonstrate the reduction in the state-space size while showing the trade-off between the size of the reconvergence horizon and the number of nodes of the multi-schedule graph.