Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279)
DOI: 10.1109/real.1998.739772
|View full text |Cite
|
Sign up to set email alerts
|

Real-time scheduling in a generic fault-tolerant architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…3) Actuating: The output actor balances the actuation effort among the (redundant) actuators that issue commands to the electronics (A/D converters or pulsewidth-modulation drivers) to set the motor torque. The actuator updates are applied to the plant at the period end to reduce jitter, a well-known technique in real-time control [24], [25].…”
Section: Proposed Methodology and Design Flowmentioning
confidence: 99%
“…3) Actuating: The output actor balances the actuation effort among the (redundant) actuators that issue commands to the electronics (A/D converters or pulsewidth-modulation drivers) to set the motor torque. The actuator updates are applied to the plant at the period end to reduce jitter, a well-known technique in real-time control [24], [25].…”
Section: Proposed Methodology and Design Flowmentioning
confidence: 99%
“…The control system repeats the following sequence at each period T max : (1) sensors are sampled, (2) software routines are executed, and (3) actuators are updated with the newlyprocessed data. The actuator updates are applied to the plant at the end of the period to help minimize jitter, a well known technique in the real-time control community [17,32]. In order to guarantee correct operation, the worstcase execution time among all possible iterations, i.e.…”
Section: Fault-tolerant Design Methodologymentioning
confidence: 99%
“…If precedence relations exist between tasks, the communication mechanisms can be simplified, since these precedence relations guarantee de:erministic execution (Wellings et al, 1998). If the receiving task is sporadic and is released by a sending task, it is guaranteed that, in all replicated components, the replicas of the task will execute with the same data.…”
Section: Hrts Replica Managermentioning
confidence: 99%