Placing forced checkpoints in distributed real-time embeddedsystems
Chiu, J.-F.
Ge-Ming Chiu
Dept. of Electr. Eng., Nat. Taiwan Inst. of Technol., Taipei;
This paper appears in: Computing & Control Engineering Journal
Publication Date: Aug 2002
Volume: 13,
Issue: 4
On page(s): 197- 205
ISSN: 0956-3385
References Cited: 10
CODEN: CCEJEL
INSPEC Accession Number: 7364836
Current Version Published: 2002-11-07
Abstract
An efficient scheme for placing forced checkpoints in a
distributed real-time embedded system so as to eliminate useless
checkpoints is presented. The notion of primary non-causal intervals is
introduced; these intervals are shown to be the only candidates that
need to be considered for inserting a minimum number of forced
checkpoints. An efficient algorithm is then used to identify the primary
non-causal intervals where forced checkpoints should be inserted. The
algorithm first converts the original problem to another problem on a
directed graph, which may reflect the existence of useless checkpoints.
The new problem can be efficiently solved using existing methods
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
