N. Lynch, M. Merri , W. Weihl and A. Feke e. Atomic Transactions. Morgan Kaufmann Publishers, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is satisfied, the CA action has aborted and no state change has happened, or the CA action has failed. Each role returns from a call whenever the corresponding instance terminates. 5 Enclosure Property The enclosure property (often referred to as atomicity in the area of transaction processing [LMWF94] of a CA action can be summarized as follows: 1) Information can be passed only at the entrance and exit of the CA action, and 2) During the execution of the action (i.e. between the begin and end of the action) a role inside that action cannot interact or communicate in any way with a role or ....

N. Lynch, M. Merrit, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, 1994.

....environment. 2. To enable further advanced studies which complement this course: in the final course project during the second term of the fifth year of the engineering degree, or at master level. As there are no support texts fully encompassing the course topics we are using multiple sources [5, 13, 14, 17] and some significant papers concerning algorithm design. An integrated view of all these elements is given to the students in a set of lecture notes [6] In [18] a prediction is made that in the long term specific parallel computing courses may well tend to disappear, and be subsumed within ....

N. Lynch, M. Merritt, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, 1994.

....optimistic WG SG F 6 F 6 P 5 [7] none SG = strongly generatable WG = weakly generatable SR = strongly revocable = with weak termination TABLE 2. Summary of the protocol compositions and achievable fairness levels depending on item properties. concept which is quite well understood [53]. Also, atomic commitment protocols like two phase commit (2PC) 54] can be adapted quite easily to enable fair exchange. Consequently, the transactional view has lead to fair exchange protocols requiring transaction coordinators which in terms of fair exchange resemble an active trusted third ....

Lynch, N. A., Merritt, M., Weihl, W., and Fekete, A. (1994) Atomic Transactions. Morgan Kaufmann, San Mateo, CA.

....consider higher level abstractions involving e.g. notions of atomicity (see requirement 7.2) recovery or replication [18] 7.2 Supporting atomic activities Description A global computing programming model should provide support for notions of atomic activities. Rationale Atomic transactions [22, 28] have emerged as a key abstraction for building resilient distributed systems. One should expect a global computing programming model to provide support for such abstractions, either in the form of in built constructs (see e.g. the ATF calculus [11] or derived ones (see e.g. the construction of ....

N. Lynch, M. Merrit, W. Weihl, and A. Fekete. Atomic transactions. Morgan Kaufmann, 1994.

....particular, as an exercise in serialisability theory, another case of a distant area of computer science concerned with notions of process, namely concurrency control theory from the database world, having an impact on a problem in process algebra. In this regard, the recent work on atomicity of [Lynch et al. 1994)] see also references therein) bears comparison with the contents of this paper. Certainly the complexity of the serialisability proofs there is rather reminiscent of what appears in the present paper. Pursuing the analogy for a moment, we can view the communications of a re calculus expression ....

Lynch N., Merritt M., Weihl W., Fekete A., Atomic Transactions. Morgan Kaufmann, (1994).

....among many possible formal tools for reasoning about systems expressed as timed automata, but they are among the most powerful for proving safety properties. The value of the simulation method for verifying safety properties of untimed systems is now well established. Many papers and books, e.g. [3, 15, 19, 21,23, 32, 38, 42], contain substantial examples of its use. Also see [14] for a persuasive discussion of the value of the technique. The use of this method for timed systems is much newer, but appears very promising. Preliminary results appear in [20, 38] 3.1 Simulations In this subsection, I define the basic ....

....relative to the part that occurs at another. For examples of such algorithms in the timed setting, consider the transformations described by Neiger and Toueg [30] and by Chaudhuri et al. 5] In the untimed setting, this style of reasoning occurs in arguments about database concurrency control [21], and about synchronizers [2, 7] It also occurs in arguments about algorithms that have the structure of communication closed layers [9] Several other examples have been verified, or partially verified, using the methods of this paper. These include a timed protocol for at most once message ....

N. Lynch, M. Merritt, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann Publishers, 1994.

....Gray93] Atomicity requires that each transaction either completes successfully or leaves the system unchanged. Atomic transactions eliminate the need for programmers to interpret and correct incomplete state changes and therefore greatly simplify the process of coping with errors [Lomet77, Lynch94] Consistency implies that each transaction in the system is only allowed to introduce valid state changes to the system. For example, a transaction would not be permitted to withdraw 100 from an account with a balance of 50. 16 Transactions are frequently used in systems that are ....

....that it made to system state will survive subsequent faults such as loss of power and system crash. Transactions, are an important programming paradigm that have been widely embraced by developers of complex fault tolerant systems, such as those used in database applications [Bernstein87, Gray93, Lynch94] In addition to guaranteeing ACID semantics, systems based upon transactions provide recovery on a per transaction basis. Recovery is typically accomplished by recording information in a durable log that is used by a recovery manager to either remove the effects of transactions which failed ....

[Article contains additional citation context not shown here]

Lynch, N., Merrit, M., Weihl, W. and Fekete, A. Atomic Transactions. San Mateo, CA: Morgan Kaufmann Publishers (1994).

....This paper formalizes a limited form of interaction by two alternative equivalent models: PTMs and SIMs. Our model is related to formalizations of process models of observability [Mi2] reactive systems by temporal logis [MP] speci cation models of data abstraction [Br] and input output automata [Ly]. It shows how PTMs can be de ned by a minimal extension of TMs and that making memory persistent (an inner property) corresponds to making the machine interactive (an outer property) The ability to remember elevates the expressiveness of PTMs above that of TMs, giving them a sense of identity. ....

N. Lynch, M. Merritt, W. Weihl, A. Fekete. Atomic Transactions. Morgan Kaufmann, 1994.

....the encapsulation of multiple actions. Transactions provide fault con nement and simplify reasoning about the properties of applications. Within the MAFTIA framework we will support two types of transactions: atomic transactions, and coordinated atomic actions. The well known atomic transactions [61] style of interaction allows the grouping of a set of operations into a single higher level action that either completes successfully or has its e ects undone. Additionally transactions guarantee the properties of atomicity, consistency, isolation and durability (ACID) Atomicity is the property ....

N. A. Lynch. Atomic Transactions. Morgan Kaufmann, 1993.

....Specifically, a committed transaction may reflect inappropriate and or malicious activity. There are two common approaches to handling the problem of undesirable but committed transactions: rollback and compensation. The rollback approach, sometimes formalized in a nested transaction model [LMWF94], is simply to rollback all activity desirable as well as undesirable to a point 10 believed to be free of damage. Such an approach may be used to recover from inadvertent as well as malicious damage. For example, users typically restore files with backup copies in the event of either a ....

N. Lynch, M. Merritt, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, San Mateo, CA, 1994.

....same is true for the composition of the pseudotime controller and pseudotime 900 M. HERLIHY et al. objects of [2] We present these examples in more detail later in this paper. In fact, we claim that almost all interesting transaction processing algorithms can be modeled as basic databases. See [14] for additional examples. Our notion of basic database identifies the aspects of transaction processing algorithms that are relevant to our analysis of orphan management algorithms. It turns out that the details of how synchronization and recovery are imple mented by a basic database are ....

....failures. The serial objects serve as a specification of how objects should behave in the absence of concurrency and failures. The serial objects serve the same purpose as the serial specifications [25] and [26] A detailed description of serial systems may be found in the references [4] and [12 14]. Now we give a definition that says that a sequence of actions looks like a serial behavior to a particular transaction. Namely, if 3 is a sequence of actions and T is a transaction name, we say that 3 is serially correct for T if there exists a serial behavior y such that y IT = 3 IT. In ....

LYNCH, N., MERRITT, M., WEIHL, W., AND FEKETE, A. Atomic Transactions. MorganKaufmann, San Mateo, Calif. To appear, Fall 1992.

....Finally, we conclude with a discussion and some suggestions for further work. In an Appendix, we briefly summarize the earlier work of ours that provides the framework for this paper. Because of length constraints, this paper omits all the proofs of our results. The proofs will appear in [6]. 2 Hybrid Atomicity This section depends on our earlier work, presented as Sections 3 to 5 of [5] and summarized in the Appendix. The development in this section closely parallels that in Section 6 of [5] and also that in [2] In our presentation we concentrate on those aspects that are ....

A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Atomic Transactions. Morgan- Kaufmann, 1992.

....atomic. Finally, we conclude with a discussion and some suggestions for further work. In an Appendix, we briefly summarize the earlier work of ours that provides the framework for this paper. Because of length constraints, this paper omits all the proofs of our results. The proofs will appear in [6]. 2 Hybrid Atomicity This section depends on our earlier work, presented as Sections 3 to 5 of [5] and summarized in the Appendix. The development in this section closely parallels that in Section 6 of [5] and also that in [2] In our presentation we concentrate on those aspects that are ....

A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Atomic Transactions. Morgan- Kaufmann, 1992.

....been extended to a timed I O automaton model [LV96] which allows modeling of timing aspects of distributed systems, including timing assumptions and performance guarantees. Both I O automata and timed I O automata can be described using simple guarded command style pseudocode (see, for example, LMWF94, Lyn96] Although I O automata were originally developed for modeling theoretical distributed algorithms, in the past few years they have been used to model practical system components such as distributed shared memory services (for example, FKL98, FGL 99] group communication services ....

....explicit representations of the parts of an automaton de nition (actions, states, transitions, and so on) Transitions are described using transition de nitions (TDs) containing preconditions and e ects. This pseudocode has evolved in two di erent forms: a declarative style (see, for example, LMWF94] in which e ects are described by predicates relating pre and poststates, and an imperative style (for example, Lyn96] in which e ects are described by simple imperative programs. In moving from pseudocode to a formally de ned programming language, we made the following design decisions: ....

Lynch, N., Merritt, M., Weihl, W., and Fekete, A. Atomic Transactions. Morgan Kaufmann Publishers, San Mateo, CA, 1994.

No context found.

N. Lynch, M. Merri , W. Weihl and A. Feke e. Atomic Transactions. Morgan Kaufmann Publishers, 1994.

No context found.

LYNCH, N., MERRITT, M., WEIHL, W., AND FEKETE, A. Atomic Transactions. Morgan Kaufmann, 1994.

No context found.

N. Lynch, M. Merrit, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, 1994.

No context found.

N. Lynch, M. Merritt, W. Weihl, A. Fekete, Atomic Transactions, Morgan-Kaufman, 1994.

No context found.

Nancy Lynch et al. Atomic Transactions. MIT Press, 1994.

No context found.

Lynch, N., Merritt, M., Weihl, W., and Fekete, A. Atomic Transactions. Morgan Kaufmann, San Mateo, CA, 1994.

No context found.

Lynch, N. A., Merritt, M., Weihl, W., and Fekete, A. (1994) Atomic Transactions. Morgan Kaufmann, San Mateo, CA.

No context found.

Lynch, N. A., Merritt, M., Weihl, W. and Fekete, A. (1994) Atomic Transactions. Morgan Kaufmann, San Mateo, CA.

No context found.

N. Lynch, M. Merrit, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, 1994.

No context found.

W. Weihl N. Lynch, M. Merritt and A. Fekete. Atomic Transactions. Morgan Kaufmann Publishers, San Mateo, CA, 1994.

No context found.

N. Lynch, M. Merrit, W. Weihl, and A. Fekete. Atomic Transactions. MorganKaufmann, 1994.

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