Ravindran, K., and S.T. Canson, Failure Transparency in Remote Procedure Calls, Transactions on Computers, IEEE, August 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Architectural Overview Of The Alpha Real-Time.. - Clark, Jensen, Reynolds (1993) (29 citations) (Correct)
.... of time; their abort processing can also be deferred for an arbitrary period of time (unless there are other mitigating circumstances) Traditional recovery techniques such as rollback and redo, and those requiring the client applications to be deterministic or idempotent (e.g. stateless) 54][55], are not always germane in real time contexts. Furthermore, performance can be improved through cooperation among non serializable transactions [56] The second major limitation of conventional transactions is that they do not have and use information about application result real time ....
Ravindran, K., and S.T. Canson, Failure Transparency in Remote Procedure Calls, Transactions on Computers, IEEE, August 1989.
Design of a Remote Procedure Call System for Object-Oriented .. - Tripathi, Noonan (1998) (2 citations) (Correct)
.... the client or the server processes, first appeared in reference [4] A system supporting remote operations in a local area network with different reliability semantics is described in reference [21] In most of the these RPC systems the design goals, in general, have been reliability[3] 4] 20] [22], performance[2] 21] 23] 24] and support for heterogeneous systems [19] A critique of the RPC paradigm is presented in reference [25] One of the criticisms of this paradigm is that it is inherently sequential in nature and does not allow the flexibility of exploiting parallelism found in ....
K. Ravindran and Samuel T. Chanson, ` Failure Transparency in Remote Procedure Calls ', IEEE Transactions on Computers, 1173--1187 (1989).
Abstractions for Constructing Dependable Distributed Systems - Mishra, Schlichting (1992) (10 citations) (Correct)
....of the mechanism require that there be no side effects in the event of an abnormally terminated call as would be the case with At Most Once semantics, for example the effects of the orphan must be undone. A number of RPC orphan detection and abortion algorithms have been described [LS83, PS88, RC89] and will be discussed further below. Another property that should be preserved by an RPC mechanism is call ordering. This criterion states that a sequence of invocations generated by a given client should result in the computations being performed by the destination servers in the same order. ....
....sets be ordered by each server replica, but the order chosen must be consistent across all replicas. This requires additional coordination that makes the implementation more complex than standard RPC. Algorithms Numerous RPC mechanisms have been described [BN84, Coo85, Cou81, LG85, LS83, PS88, RC89] These algorithms differ from one other in their assumptions about the underlying network and the type of processor failures to be tolerated, in the particular semantics they implement, whether they support replicated procedure call, and in their treatment of orphans. The algorithms proposed in ....
[Article contains additional citation context not shown here]
K. Ravindran and S. T. Chanson. Failure transparency in remote procedure calls. IEEE Transactions on Computers, 38(8):1173--1187, Aug 1989.
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