Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Computer Engineering
Fault-Tolerant Method And Simulation Of Heterogeneous Multi-Core Processor Based On Speculative Mechanism, Shigan Yu, Zhimin Tang, Xiaochun Ye, Dongrui Fan
Fault-Tolerant Method And Simulation Of Heterogeneous Multi-Core Processor Based On Speculative Mechanism, Shigan Yu, Zhimin Tang, Xiaochun Ye, Dongrui Fan
Journal of System Simulation
Abstract: Heterogeneous multicore is one of the important branches of processors,but they are still faced with frequent transient failures. TMR(Triple mode redundancy) is the main method to solve transient faults, which has the characteristics of low efficiency and high power consumption, a high-performance Fault-Tolerant Scheduling Algorithm with Speculative mechanism(FTSAS) is proposed. Each heterogeneous core can execute tasks independently, the state values of the first completed core are recorded, and the first completed core continues to perform the next task with forward speculative method. The results are compared by backward core, the majority consensus principle is adopted to ensure the reliability …
Flexibility Of Remediation Methods For Winding Open Circuit Faults In A Multiphase Pm Machine Considering Iron Losses Minimization, Fan Wu, Ayman M. El-Refaie
Flexibility Of Remediation Methods For Winding Open Circuit Faults In A Multiphase Pm Machine Considering Iron Losses Minimization, Fan Wu, Ayman M. El-Refaie
Electrical and Computer Engineering Faculty Research and Publications
The flexibility of post-fault control in multiphase machine systems stems from their multiple degrees of freedom. A post-fault loss-minimization method is proposed and investigated in this paper, in which both the machine copper and iron losses are considered during the derivation of post-fault remediation methods. Therefore, machine efficiency during post-fault operation can be further improved compared to the conventional stator-ohmic-loss-minimization approach. In addition, the combination of three key factors/constraints that can influence the post-fault control strategy of a six-phase permanent magnet (PM) machine has been investigated. By comparing four selected remediation methods based on three constraints, the pros and cons …
High Performance Fault-Tolerant Scheduling Method And Simulation For Heterogeneous Multicore, Shigan Yu, Zhimin Tang, Xiaochun Ye, Zhimin Zhang
High Performance Fault-Tolerant Scheduling Method And Simulation For Heterogeneous Multicore, Shigan Yu, Zhimin Tang, Xiaochun Ye, Zhimin Zhang
Journal of System Simulation
Abstract: To deal with the problem of low performance and high power consumption when solving the transient fault of the processor with three mode redundancy (TMR), a task execution algorithm for heterogeneous multicore considering fault tolerant (TEAHFT) is proposed. The tasks to be executed are divided into sensitive tasks and fault-tolerant tasks. The sensitive tasks are executed in a TMR mode, and the fault-tolerant tasks are executed in a competitive scheduling mode. The task will be rerun in TMR method if the results of the fault-tolerant tasks do not meet the reliability threshold. The simulation experimental results show that TEAHFT …
Tapu: Test And Pick Up-Based $K$-Connectivity Restoration Algorithm For Wireless Sensor Networks, Vahi̇d Khali̇lpour Akram, Orhan Dağdevi̇ren
Tapu: Test And Pick Up-Based $K$-Connectivity Restoration Algorithm For Wireless Sensor Networks, Vahi̇d Khali̇lpour Akram, Orhan Dağdevi̇ren
Turkish Journal of Electrical Engineering and Computer Sciences
A $k$-connected wireless sensor network remains connected if any $k$-1 arbitrary nodes stop working. The aim of movement-assisted $k$-connectivity restoration is to preserve the $k$-connectivity of a network by moving the nodes to the necessary positions after possible failures in nodes. This paper proposes an algorithm named TAPU for $k$-connectivity restoration that guarantees the optimal movement cost. Our algorithm improves the time and space complexities of the previous approach (MCCR) in both best and worst cases. In the proposed algorithm, the nodes are classified into safe and unsafe groups. Failures of safe nodes do not change the $k$ value of …