ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

A theorem on atomicity in distributed algorithms (1990)

Lamport, Leslie

Springer

Distributed computing 4 (1990), S. 59-68

add to mindlist on the mindlist

Details

ISSN: 1432-0452

Keywords: Message passing ; Reduction

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Notes: Abstract Reasoning about a distributed algorithm is simplified if we can ignore the time needed to send and deliver messages and can instead pretend that a process sends a collection of messages as a single atomic action, with the messages delivered instantaneously as part of the action. A theorem is derived that proves the validity of such reasoning for a large class of algorithms. It generalizes and corrects a well-known folk theorem about when an operation in a multiprocess program can be considered atomic.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01786631

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit