Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors

Baek, Hyeongboo; Lee, Jaewoo

doi:10.3390/sym11050651

Cited by 5 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the development and universal application of microcomputers, fault-tolerant technology has developed rapidly in multiprocessor systems, flying hoc networks, cloud computing, wireless sensor networks and so on [1][2][3][4]. In recent years, fault-tolerant technology has also received extensive attention in the field of multi-phase motor control.…”

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Control Strategy for 12-Phase Permanent Magnet Synchronous Motor

et al. 2019

View full text Add to dashboard Cite

Multi-phase motors have attracted increasing attention in fields seeking high reliability, such as electric vehicles, ships, and rail transit, as they exhibit advantages, such as high reliability and fault tolerance. In this study, we consider a 12-phase permanent magnet synchronous motor (PMSM). First, a mathematical model of the 12-phase PMSM in the static coordinate system is established and the model is simplified according to the constraint condition of neutral point isolation. Second, according to the principle of invariant magnetomotive force under normal and fault conditions, two optimal control strategies of winding current, i.e. maximum torque output (MTO) and minimum copper consumption (MCC), are proposed. For a single-phase open-circuit fault, two optimization methods are used to reconstruct the residual phase current, such that the motor can maintain normal torque output and exhibit lower torque ripple under the fault state. Finally, system simulation and experimental research are conducted; the results verify the accuracy and feasibility of the fault-tolerant control strategy of the 12-phase PMSM proposed in this paper.

show abstract

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Control Strategy for 12-Phase Permanent Magnet Synchronous Motor

et al. 2019

View full text Add to dashboard Cite

show abstract

“…For a given task utilization for τ i (u i ), p i is uniformly selected in [1,1000]; C i is computed based on the given utilization and p i (i.e., e i = p i • u i ); and d i is set to p i . The randomly generated task parameters are known to sufficiently cover the general cases of real systems such as antenna controller software in an unmanned aerial vehicle as shown in the previous studies [35], [36].…”

Section: Discussionmentioning

confidence: 99%

Response-Time Analysis for Multi-Mode Tasks in Real-Time Multiprocessor Systems

2020

Self Cite

View full text Add to dashboard Cite

Recently, traditional real-time systems that played a dedicated role in a limited environment have been evolving to interact with dynamically varying environments. In modern real-time systems, characteristics of real-time tasks such as computational demand and resource allocation can vary over time according to different circumstances, which is referred to as mode transition. In this paper, we focus on the problem of timing guarantees of a set of multi-mode tasks associated with mode transitions and develop an offline schedulability analysis, which does not require any online information; this is an important problem in the real-time systems area. The proposed schedulability analysis not only generalizes an existing framework designed for single-mode tasks, but also significantly improves the state-of-the-art framework designed for multi-mode tasks. Building on the proposed analysis, we also address the problem of enforcing the order of tasks within each mode transition and propose a task-level transition order assignment algorithm, yielding further improvement in schedulability performance. Through simulations, our proposed framework is shown to improve schedulability up to 777.3% over an existing schedulability analysis for multi-mode tasks, depending on the experiment setting under our evaluation environment. INDEX TERMS Real-time scheduling, multi-mode tasks, schedulability analysis, real-time multiprocessor systems.

show abstract

“…The goal of the work is to enhance the reliability of the system without adding extra redundancy for fault tolerance, to detect both transient and permanent faults, and to recover existing faults. Baek and Lee [23] propose a fault-tolerant scheme that can be incorporated with real-time scheduling algorithms on multiprocessor systems to improve the reliability of the target system without a tradeoff against schedulability. They applied this fault-tolerant scheme to existing fixed-priority scheduling and earliest deadline zero-laxity scheduling, and they claimed that it enhances reliability without schedulability loss.…”

Section: Literature Reviewmentioning

confidence: 99%

Simulation-based fault-tolerant multiprocessors system

Al-Allaf

Farej

2023

TELKOMNIKA

View full text Add to dashboard Cite

System reliability is an important issue in designing modern multiprocessor systems. This paper proposes a fault-tolerant, scalable, multiprocessor system architecture that adopts a pipeline scheme. To verify the performance of the proposed system, the SimEvent/Stateflow tool of the MATLAB program was used to simulate the system. The proposed system uses twelve processors (P), connected in a linear array, to build a ten-stage system with two backup processors (BP). However, the system can be expanded by adding more processors to increase pipeline stages and performance, and more backup processors to increase system reliability. The system can automatically reorganize itself in the event of a failure of one or two processors and execution continues without interruption. Each processor communicates with its neighboring processors through input/output (I/O) ports which are used as bypass links between the processors. In the event of a processor failure, the function of the faulty processor is assigned to the next processor that is free from faults. The fast Fourier transform (FFT) algorithm is implemented on the simulated circuit to evaluate the performance of the proposed system. The results showed that the system can continue to execute even if one or two processors fail without a noticeable decrease in performance.

show abstract

Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors

Cited by 5 publications

References 20 publications

Fault-Tolerant Control Strategy for 12-Phase Permanent Magnet Synchronous Motor

Fault-Tolerant Control Strategy for 12-Phase Permanent Magnet Synchronous Motor

Response-Time Analysis for Multi-Mode Tasks in Real-Time Multiprocessor Systems

Simulation-based fault-tolerant multiprocessors system

Contact Info

Product

Resources

About