Abstract
Limiting the extent of error propagation when faults occur and localizing the subsequent error recovery are common concerns in the design of fault tolerant parallel processing systems, Both activities are made easier if the designer associates fault tolerance mechanisms with the underlying atomic actions of the system, With this in mind, this paper has investigated two methods for the identification of atomic actions in parallel processing systems described using CSP, Explicit trace evaluation forms the basis of the first algorithm, which enables a designer to analyze interprocess communications and thereby locate atomic action boundaries in a hierarchical fashion, The second method takes CSP descriptions of the parallel processes and uses structural arguments to infer the atomic action boundaries. This method avoids the difficulties involved with producing full trace sets, but does incur the penalty of a more complex algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 629-639 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Software Engineering |
| Volume | 21 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - Jul 1995 |
Bibliographical note
Copyright © 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Keywords
- ATOMIC ACTIONS
- CONCURRENT SYSTEMS
- CSP
- FAULT TOLERANCE
- DISTRIBUTED SYSTEMS
- CONVERSATION SCHEME
- SOFTWARE
- ROBUST