R. D. Schlichting and F. B. Schneider. Fail-stop processors: an approach to designing fault-tolerant computing systems. In ACM Transactions on Computer Systems, volume 1, pages 222238, 1983. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An Efficient Optimistic Message Logging Scheme for Recoverable .. - Park, al. (Correct)
....Failures assumed in this paper are transient and independent; that is, a process does not likely fail again at the same execution point after it recovers from a failure; and the failure of a process does not affect the other processes in the system. The processes are also assumed to be fail stop [25]. In case of a failure, the process stops its execution and does not perform any malicious action. When a failure occurs, the contents stored in the volatile memory of the MH or the MSS would be lost, however, the stable storage survives the failure. Reliable message delivery is assumed; that is, ....
R.D. Schlichting and F.B. Schneider, "Fail-stop Processors: An Approach to Designing Fault-tolerant Computing Systems," ACM Transactions on Computer Systems, Vol. 1, No. 3, Aug. 1983, pp. 222--238.
Fault Tolerance for a Workstation Cluster - Elmootazbellah Elnozahy Willy (Correct)
....graph. The recovery protocol uses the information in the graph to restore the system to some consistent state, which is also consistent with the observable effects of the computation as perceived by the outside world. 2 Assumptions We assume that the computation consists of a number of fail stop [10] recovery units (RU s) 11] which communicate only by messages over an asynchronous network. An RU consists of one or more threads that manipulate the RU s internal state. Each RU has access to a stable storage device. A failed RU can be restarted on any available machine. The execution of an RU ....
R.D. Schlichting and F.B. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems, 1(3):222--238, August 1983.
A Protocol for Lock Based Cache Consistency in the Pegasus.. - Lein-Mathisen (1992) (Correct)
....users of the Pegasus system access to the file system. The high level services does not make any assumptions on the local file system, besides that it is able to establish a secure channel to another entity by knowing its name, if it has storage it is volatile and the failure model is crash stop [38]. The local file system will use caching to provide good performance. The complete architecture consist of five parts which makes the complete system with hardware,software, protocols, and interfaces and is shown in figure 2.6. The line of trust illustrates that the server do not trust the client. ....
Schlichting, R. D., and Schneider, F. B. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems 1, 3 (August 1983), pp. 222--238.
The Performance of Checkpointing and Replication Schemes.. - Park, Byun, Kim, Yeom (Correct)
....The UserAgent class supports the application agents and the SystemAgent class is for the stationary system service agents of the location. Failures considered in the system are the agent failure, the location failure and the system failure. For all of these failure types, the fail stop [7] model is assumed. Agent and location failures are usually caused by incorrect agent states or location states; and hence the recovery information saved for the agent or location can survive the failure. However, the system failure is usually caused by a system crash which results in the loss of ....
R.D. Schlichting and F.B. Schneider, "Fail-stop Processors: An Approach to Designing Fault-tolerant Computing Systems, " ACM Transactions on Computer Systems, 1(3):22 238, 1983.
An Efficient Optimistic Message Logging Scheme for the.. - Park, Woo, Yeom (2001) (Correct)
....always produces the same sequence of states in its execution if the same sequence of message receipt events would happen. Failures considered in the paper are transient; that is, a process does not likely fail again at the same execution point after it recovers from a failure. Also, the fail stop [20] processes are assumed. In case of a failure, a process stops the execution and does not perform any malicious action. When a MH or a MSS fails, the contents of the volatile memory would be lost, however, the stable storage survives the failure. Reliable message delivery is assumed; that is, there ....
R.D. Schlichting and F.B. Schneider, "Fail-stop Processors: An Approach to Designing Faulttolerant Computing Systems," ACM Transactions on Computer Systems, Vol. 1, No. 3, Aug. 1983, pp. 222--238.
An Efficient Causal Logging Scheme for Recoverable.. - Park, Lee, Yeom (2002) (Correct)
....causal logging and recovery schemes are presented with their correctness. The performance of the proposed scheme is discussed with the experimental results in Section 4 and Section 5 concludes the paper. 2 Preliminaries 2. 1 System model A DSM system consisting of a number of fail stop nodes [19], connected through a communication network, is considered. Each node consists of a processor, a volatile main memory and a non volatile secondary storage. The processors in the system do not share any physical memory and communicate by message passing. However, the system can be viewed as a set ....
R.D. Schlichting, F.B. Schneider, Fail-stop processors: An approach to designing fault-tolerant computing systems, ACM Transactions on Computer Systems, 1(3) (1983) 222-238.
NAP: Practical Fault-Tolerance for Itinerant Computations - Johansen, Marzullo.. (1999) (14 citations) Self-citation (Schneider) (Correct)
....on that host. If a landing pad crashes, then all of the mobile agents currently executing at that landing pad also crash. We assume that the crash of a landing pad is eventually detected by a small, well defined set of landing pads. This is equivalent to assuming the fail stop failure model of [13]. One must have enough replication to ensure that an itinerant computation is recoverable. A common way to ensure sufficient replication is to compute a value f such that if no more than f crashes occur then the computation is recoverable. A straightforward wayto define suchanf is as follows: ....
....experienced during the execution of an action causes the agenttobelost. An option of move specifies that action restarted upon recovery of the landing pad [8] We therefore extend the definition of a action to better accommodate crashes. The definition we use is based on fault tolerant actions [13]. A fault tolerant action FTA can be written as FTA: action A recovery A where A is called a regular action and A is called the recovery action associated with A. The execution of FTA satisfies the following properties: 1. A executes at most once, either with or without failing. 2. If A ....
R. D. Schlichting and F. B. Schneider. Failstop processors: An approach to designing faulttolerant computing systems. ACM Transactions on Computer Systems 1(3):222-238, August 1983.
Unknown - Apport De Recherche (Correct)
No context found.
R. D. Schlichting and F. B. Schneider. Fail-stop processors: an approach to designing fault-tolerant computing systems. In ACM Transactions on Computer Systems, volume 1, pages 222238, 1983.
Fault-tolerant Parallel Applications with Dynamic Parallel.. - Gerlach, Hersch (2005) (Correct)
No context found.
R.D. Schlichting, F.B. Schneider, Fail-stop processors: An approach to designing fault-tolerant computing systems, ACM Transactions on Computer Systems Vol. 1, No. 3, pp. 222--238, 1983
Performance and Effectiveness Trade-Off for.. - Katsaros, Angelis, Lazos (2006) (Correct)
No context found.
Schlichting R. D., Schneider F. B. 1983. Fail-Stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems, 1 (3): 222-238.
Evaluation of Composite Object Replication Schemes for .. - Katsaros, Iakovidou.. (Correct)
No context found.
R. D. Schlichting, F. B. Schneider, Fail-Stop processors: An approach to designing fault-tolerant computing systems, ACM Transactions on Computer Systems, 1, 3, 1983
The Safety and Liveness Properties of a Protocol Family - For Versatile Survivable (Correct)
No context found.
Richard D. Schlichting and Fred B. Schneider. Fail-stop processors: an approach to designing faulttolerant computing systems. ACM Transactions on Computer Systems, 1(3):222--238. ACM Press, August 1983. 25
A Survey of Fault-Tolerance and Fault-Recovery Techniques in.. - Treaster (2005) (2 citations) (Correct)
No context found.
R. Schlichting and F. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computing Systems, 1(3):222--238, 1983.
An Index-Based Checkpointing Algorithm for - Autonomous Distributed Systems (Correct)
No context found.
R.D. Schlichting and F.B. Schneider, Fail-Stop Processors: an Approach to Designing Fault-Tolerant Computing Systems, ACM Trans. on Computer Systems, vol. 1, no. 3, pp. 222-238, 1983.
Why Do Computers Stop And What Can Be Done About It? - Gray (1985) (77 citations) (Correct)
No context found.
Schlichting, R.D., Schneider, F.B., "Fail-Stop Processors, an Approach to Designing Fault-Tolerant Computing Systems", ACM TOCS, Vol. 1, No. 3, Aug. 1983.
Functionality/Dependability Co-design in Real-Time Embedded.. - Strunk, Knight (Correct)
No context found.
Schlichting, R. D., and F. B. Schneider. "Fail-stop processors: An approach to designing fault-tolerant computing systems." TOCS 1(3):222-238.
Implementable Models for Replicated And Fault-Tolerant.. - Briz (2003) (Correct)
No context found.
R.D. Schlichting and F.B. Schneider. Fail-stop processors: an approach to designing fault-tolerant computing systems. In ACM Transactions on Computer Systems, pages 222--238, 1983.
The Safety and Liveness Properties of a Protocol.. - Goodson, Wylie.. (2004) (2 citations) (Correct)
No context found.
Richard D. Schlichting and Fred B. Schneider. Fail-stop processors: an approach to designing faulttolerant computing systems. ACM Transactions on Computer Systems, 1(3):222--238. ACM Press, August 1983. 25
Multi-Dimensional Quorum Sets for - Read-Few Write-Many Replica (Correct)
No context found.
R. D. Schlichting and F. B. Schneider. Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems, 1(3):222--238, August 1983.
Towards Fault-Tolerant and Secure On-Line Services - Zhou (2001) (3 citations) (Correct)
No context found.
R. D. Schlichting and F. B. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems, 1(3):222238, August 1983.
Optimal Object State Transfer - Recovery Policies for Fault.. - Katsaros, Lazos (2004) (Correct)
No context found.
R. D. Schlichting and F. B. Schneider, "Fail-Stop processors: An approach to designing fault-tolerant computing systems", ACM Transactions on Computer Systems, 1, 3, 1983.
Practical Impact of Group Communication Theory - Schiper (2003) (1 citation) (Correct)
No context found.
43 R.D. Schlichting and F.B. Schneider. Fail-stop processors: an approach to designing faulttolerant computing systems. ACMTrans. on Computer Systems, 1(3):222--238,August 1983.
Making Reliable Distributed Systems in the Presence of Software.. - Armstrong (2003) (1 citation) (Correct)
No context found.
Richard D. Schlichting and Fred B. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. Computer Systems, 1(3):222--238, 1983.
Early-Delivery Dynamic Atomic Broadcast - Ziv Bar-Joseph Idit (Correct)
No context found.
R. D. Schlichting and F. B. Schneider. Fail stop processors: an approach to designing faulttolerant computing systems. ACM Trans. Comput. Syst., 1(3):222--238, Aug. 1983.
A Lightweight Message Logging Scheme for Fault Tolerant MPI - Lee, Yeom, Park, Park (Correct)
No context found.
Schlichting, R.D., Schneider, F.B.: Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Trans. on Computer Systems 1 (1983) 222-238
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC