Lampson, B.W., "Atomic Transactions", Distributed Systems -- Architecture and Implementation: An Advanced Course. Chapter 11.Lecture Notes in Computer Science #105, Springer-Verlag, 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Obj85 Obj86 Oops86 Stef85 Stoy84] Transactions: The notion of transactions and atomic actions, particularly nested transactions, is relevant to environments with many concurrent active objects. Nested transactions are available in the Argus system. See also papers on concurrency and reliability. [Gray81 Lamp81 Moss81 Moss82 Moss83] Types: Various papers dealing with data types. See also papers on data abstraction. Alle86 Bruc86 Card85b Grie77 Inga86 Wall80 Zdon86b] UIMS: How object oriented ideas can be applied in the development of user interfaces. Fium83] 5 Unreferenced. The following list includes systems and work ....

B.W. Lampson, "Atomic Transactions", in Distributed Systems -- Architecture and Implementation, ed. B.W. Lampson, M. Paul and H.J. Siegert, Lecture Notes in Computer Science 150, pp. 246-265, Springer-Verlag, 1981.

....not assumed; instead, state information is replicated at other processors. However, this turns out to be just an approximation of the Stable Storage Property. The only work we know of that does not involve fail stop or stronger assumptions about processor failures is described in [6] 7] and [9]. ACM Transactions on Computer Systems, Vol. 2, No. 2, May 1984. Real processors do not satisfy the Halt on Failure, Failure Status, or Stable Storage properties. In fact, most real processors are not even good approximations of fail stop processors. This is disappointing in light of the number ....

LAMPSON, B. Atomic transactions. In Distributed Systems--Architecture and Implementation. Lecture Notes in Computer Science, vol. 105, Springer-Verlag, New York (1981), pp. 246-265.

....such Web service, it will either commit or abort, and if it commits, its effects cannot be undone. The second level consists of Web services that can be aborted or compensated. There are two traditional ways to abort or compensate a previous executed service. One way, named two phase commit (2PC) [8], is based on the idea that no constituent transaction is allowed to commit unless they are all able to commit. Another way, called compensation, is based on the idea that a constituent transaction is always allowed to commit, but its effect can be cancelled after it has committed by executing a ....

Lampson, B. W., "Atomic Transactions". In: Goos, G., Hartmanis, J. (eds.), Distributed Systems - Architecture and Implementation: An Advanced course, Spring-Verlag, pp. 246265, 1981

....mechanism is its commit p otool, which in a distributed system is a protocol that ensures that the nodes participating in an action either all commit or all abort. To commit top level actions, our models use a variation of a standard two phase commit protocol [Gray 1979, Mohan ; Lindsay 1983, Lampson 1981, Lindsay et al. 1979, Lindsay et al. 1984] Non blocking and three phase commit protocols have also been studied [Skeen 1981, Dwork i; Skeen 1983] Two phase commit and the other protocols mentioned above ensure that all partici In a timestamping approach, an action s serialization order is ....

....out of order. We assume that failures are eventually repaired: nodes eventually recover from crashes, and partitions are eventually mended. Nodes have access to both volatile and stable storage. Volatile storage is lost in a crash, while stable storage is intact upon the recovery of a node [Lampson 1981]. 2.2 High level System At a higher level of abstraction, we view a distributed system as a collection of active communicating entities, where each entity resides at a single node in the network. Entitles are resilient; with high probabi]ity, they survive crashes of their nodes (this is done, ....

[Article contains additional citation context not shown here]

Butler Lampson. Atomic transactions. In B. W. Lampson, M. Paul, and H. J. Siegert, editors, Distributed Systems -- Architecture and Implementation, chapter 11, pages 247--265, Springer-Verlag, 198]. Lecture Notes in Computer Science series, mmber 10,5.

....errors originated in the disk drive and controller are partly handled by the hardware itself; modern storage systems are equipped with powerful coding mechanisms to detect and correct decay errors. To tolerate soft errors during disk access we employ the careful disk operations, as described in [14]. A careful read operation repeatedly performs a normal disk read until it gets a good status or a predefined limit of retries is exceeded. This eliminates soft read errors. A careful write operation repeatedly performs a normal disk write followed by a read until it returns a good status with the ....

B. Lampson, "Atomic transactions," in Distributed Systems-Architecture and Im- plementation, vol. 105 of Lecture Notes in Computer Science, pp. 246-265, New York, NY: Springer-Verlag, 1981.

....to represent replicated data. We make use of timestamp generation schemes due to Lamport [Lainport 78] Dubourdieu [Dubourdieu 82] and Chan et al. Chan 82] Logs have been used to facilitate recovery in databases [Gray 78] and as a technique for achieving reliably coordinated updates [Lampson 79] In the Swallow .repository [Reed 80] an object is represented by a sequence of versions, a mechanism with many of the same properties as a log. Replication methods for files have been proposed that relax the requirement that the value read from a file should be the last value wdtten. ....

Lampson, B., "Atomic transactions", Distributed Systems: Architecture and Implementatio n, Lecture Notes in Computer Science 105, Goos and Hartmanis editors, Springer. Verlag, Bedin, 1981, 246.265.

....limitations. However, the advent of machines such as the DEC Alpha [41] and the MIPS R4000 [18] which (logically) support a 64 bit address has created renewed interest in this approach. A number of research groups have suggested that this is an appropriate direction for modern operating systems [22]. Such an approach is tempting since it fits in well with the goals of orthogonal persistence, i.e. to abstract over all physical attributes of data. However, there are some difficulties: Most persistent systems rely upon a checkpointing mechanism to establish a consistent state on stable storage ....

....entities stored in the system so that dependency information can be maintained. ii. If a single address space is shared by multiple processes, the ability to protect separate areas of the address space must be provided. Whilst protection systems have been designed for single address spaces [22], they do not provide any support for distribution. iii. The resulting store would be huge and the management of large stores is difficult. In particular allocation of free space, garbage collection, unique naming of new objects and the construction of appropriate navigation tools are all more ....

[Article contains additional citation context not shown here]

Lampson, B. "Atomic Transactions", Distributed Systems - Architecture and Implementation, Lecture Notes in Computer Science, vol 105, Springer-Verlag, Berlin, pp. 246-265, 1981.

....atomic transactions despite the effects of concurrency and distribution, as usual [2] and partial failures of its components, notably disks and communication media. Disks may: corrupt the block written, fail to write a value, respond with a corrupted read value or corrupt the block which is read [10]. Media may: loose, replicate, corrupt or create messages [17] Before we apply such devices in the design, we add enough layers of software to mask the corresponding faults. This is done incrementally i.e. one fault at a time; there are four steps for each device. Such steps which strengthen ....

B.W. Lampson. Atomic transactions. In M. Paul B.W. Lampson and H.J. Siegert, editors, Distributed Systems - Architecture and Implementation, pages 246--265. Springer-Verlag, 1981.

....10 . Fault tolerance is (also) a recursive concept; the mechanisms designed to tolerate faults must be protected against the faults likely to affect them. Examples are given by the replication of voters, self checking controllers [Carter Schneider 1968] through the notion of stable memory [Lampson 1981] in recovery data and programs. Fault tolerance is not limited to accidental faults. Protection against intrusions has long relied on cryptography (e.g. see [Denning 1982] for an early overview) In particular, encryption can be viewed as a form of tolerance in that ciphered information can be ....

B. W. Lampson, "Atomic Transactions", in Distributed Systems --- Architecture and Implementation, (B. W. Lampson, Ed.), Lecture Notes in Computer Science, 105, pp.246-65, Springer-Verlag, Berlin, Germany, 1981.

....delay. Stable storage [21, Section 3.3] ensures that read and write operations on the storage are always successful, even if the underlying storage hardware components fail. This is useful for fault tolerance methods requiring that some state of the system be available after a failure occurs. [27] denes the problem of the stable storage and gives a protocol that works with one disk in the presence of arbitrary faults. Other classical protocols are disk shadowing and Redundant Arrays of Inexpensive Disks (RAID) Fail stop processors [21, Section 3.4] is the assumption made on the behavior ....

B.W. Lampson. Atomic transactions. In B.W. Lampson, M. Paul, and H.J. Siegert, editors, Distributed Systems-Architecture and Implementation, volume 105 of LNCS, pages 246265. Springer Verlag, 1981.

....9 the possibility of a collection of operations either succeeding or failing atomically. This layering of failure guarantees is in turn essential in handling the complexity of building fault tolerant applications. Various mechanisms have been proposed for achieving atomic failure. Transactions [30] have been used very successfully in databases to make compound database updates atomic. Atomicity here is used in two respects: an update either succeeds or fails atomically, and it is not possible to observe the interleaving of two updates. Transaction correctness is normally based on ....

Butler Lampson. Atomic transactions. In B. Lampson, M. Paul, and H. Siegert, editors, Distributed Systems--Architecture and Implementation, volume 205 of Lecture Notes in Computer Science, pages 246--285. Springer-Verlag, 1981.

....network failures are more common than client crashes so it is valuable to arrange the le system operation in a way that means that the integrity of the le system is maintained, even when a client operation fails. To do this the block based network le system uses a modi ed atomic update scheme[Lampson, 1981] that we call Unstable Atomic Update . In this algorithm the server delays all write operations until the end of a le system transaction. When the transaction completes the server writes all the modi ed blocks to the disk (and releases any leases associated with the blocks) If the network ....

....executed and the le system might be left in an inconsistent state. It is this violation of the atomic nature of a transaction when a server failure occurs that gives Unstable Atomic Update its name. It would be possible to protect the le system against server failure by using stable storage[Lampson, 1981]. However stable storage require that at least three extra write operations occur for each write operation placed in the intentions list and is based on an assumption that is dicult to meet without writing the intentions list to two di erent disk drives concurrently. Full atomic update is not ....

Lampson, B. W. (1981). Atomic transactions. Lecture Notes in Computer Science. Distributed Systems { Architecture and Implementation, 105:246-265.

....to propose some programming guidelines. These are discussed in the following. 7.1.3. 1 General principles for non standard servers If each service of a server is programmed as a restartable operation O, servicing a request despite a processor failure can be obtained in the following way [Lampson 81a] 1) Save the server s context in stable storage, 2) Perform O,and (3) Erase the server s context from stable storage. If a processor failure occurs while performing O, the process will resume after (1) and will perform O again, the resulting execution sequence is equivalent to a single ....

....processes need to obey a particular protocol. In order to facilitate the provision of fault tolerance measures within a non standard server, the server might require that the client commits its request before further action by the server. In other words, the client s request is an intention [Lampson 81a] that has to be performed by the server. The underlying reason is that in general it will be easier for a non standard server to restart the processing of a request than to be possibly obliged to cancel the processing of a request (an orphan execution) retracted by a rolled back client. In the ....

LAMPSON, B. Atomic Transactions. In Distributed Systems and Architecture and Implementation : an Advanced Course, Vol.105 of Lecture Notes in Computer Science, pp.246--265, Springer Verlag, 1981.

....10 . Fault tolerance is (also) a recursive concept; the mechanisms designed to tolerate faults must be protected against the faults likely to affect them. Examples are given by the replication of voters, self checking controllers [Carter Schneider 1968] through the notion of stable memory [Lampson 1981] in recovery data and programs. Fault tolerance is not limited to accidental faults. Protecting against intrusions has long relied on cryptography [Denning 1982] which can be viewed as a form of tolerance in that ciphered information can be inspected by an intruder without compromising its ....

B. W. Lampson, "Atomic Transactions", in Distributed Systems --- Architecture and Implementation, (B. W. Lampson, Ed.), Lecture Notes in Computer Science, 105, pp.246-65, Springer-Verlag, Berlin, Germany, 1981. Malicious- and Accidental- Fault Tolerance for Internet Applications 109

....loosely synchronized clocks at each process and a bounded delay for messages in transit. To reclaim cycles this variant may require a process to traverse its local pointer graph multiple times. This is not a good solution because of its cost in terms 2 A stable store, as defined by Lampson [75], is a set of objects that move atomically from one consistent state to another. CHAPTER 2. OVERVIEW OF GC ALGORITHMS 47 of performance. Therefore, to reclaim distributed cycles a solution similar to the previous one (tracing with timestamps) must be used. Finally, the central service can become ....

B. Lampson. Atomic transactions. In Distributed Systems---Architecture and Implementation, pages 246--265. Spinger-Verlag, New York, 1981. Lecture Notes in Computer Science vol. 105.

No context found.

Lampson, B.W., "Atomic Transactions", Distributed Systems -- Architecture and Implementation: An Advanced Course. Chapter 11.Lecture Notes in Computer Science #105, Springer-Verlag, 1981.

No context found.

Lampson, B.W., Sturgis, H., "Atomic Transactions", Distributed Systems Architecture and Implementation; An Advanced Course, Lecture Notes in Computer Science, V. 105, Springer Verlag, 1981.

No context found.

Butler Lampson. Atomic transactions. In B. Lampson et. al., editor, Distributed Systems -- Architecture and Implementation: An Advanced Course, volume 105 of Lecture Notes on Computer Science, pages 246--265. Springer-Verlag, 1981.

No context found.

Lampson, B. W. (1981) Atomic transactions. In Lecture Notes in Computer Science, vol. 105, pp. 246--265. Springer-Verlag, Berlin.

No context found.

B. W. Lampson. Atomic transactions. In Distributed Systems: Architecture and Implementation, Lecture Notes in Computer Science, pages 254-259. Springer-Verlag, Berlin, 1981.

No context found.

B. Lampson, "Atomic transactions," in Distributed Systems--Architecture and Implementation, ser. Lecture Notes in Computer Science, B. Lampson, M. Paul, and H. Siegert, Eds. Springer-Verlag, 1981, vol. 205, pp. 246--285.

No context found.

Lampson, B.W. Atomic Transactions, in Distributed Systems: Architecture and Implementation - AnAdvanced Course, B.W. Lampson (Ed.), LNCS, Vol. 105, Springer-Verlag, pp. 246-265, 1981.

No context found.

B. W. Lampson and H. E. Sturgis. Atomic transactions. In B. W. Lampson, M. Paul, and H. J. Siegert, editors, Distributed Systems---Architecture and Implementation: an Advanced Course, volume 105 of Lecture Notes in Computer Science, pages 246--65. Springer-Verlag, New York, 1981.

No context found.

B. Lampson, `Atomic transactions', in Distributed Systems---Architecture and Implementation, SpringerVerlag, Berlin, 1981, pp. 246--265.

No context found.

Lampson, B.W., Atomic Transactions, in the same book as [Hol 81], pp.246-265. Ch. II.6.

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