Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Distributed algorithms / (2003)
    San Francisco, Calif. :Morgan Kaufmann,
    Details
    Title: Distributed algorithms /
    Author: Lynch, Nancy A.
    Edition: [Nachdr.]
    Publisher: San Francisco, Calif. :Morgan Kaufmann,
    Year of publication: 2003
    Pages: XXIII, 872 S.
    Series Statement: Morgan Kaufmann series in data management systems
    ISBN: 1-55860-348-4
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 2
    Book
    Book
    Atomic transactions / (1994)
    San Mateo, Calif. :Morgan Kaufmann Publ.,
    Details
    Title: Atomic transactions /
    Contributer: Lynch, Nancy A.
    Publisher: San Mateo, Calif. :Morgan Kaufmann Publ.,
    Year of publication: 1994
    Pages: XXI, 500 S.
    Series Statement: Morgan Kaufmann series in data management systems
    ISBN: 1-55860-104-X
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 3
    Electronic Resource
    Electronic Resource
    Using mappings to prove timing properties (1992)
    Springer
    Distributed computing 6 (1992), S. 121-139 
    Details
    ISSN: 1432-0452
    Keywords: Timing properties ; Timing-based algorithms ; Formal specification ; Formal verification ; Assertional reasoning ; Possibilities mappings ; Timed automata ; I/O automata ; Progress functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary A new technique for proving timing properties for timing-based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multi-valued mapping from the “assumptions automaton” to the “requirements automaton” is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of “progress functions” providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a two-process race system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252683
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Easy impossibility proofs for distributed consensus problems (1986)
    Springer
    Distributed computing 1 (1986), S. 26-39 
    Details
    ISSN: 1432-0452
    Keywords: Agreement ; Distributed computing ; Fault tolerance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in certain communication graphs. It is shown that, in the presence ofm faults, no solution to these problems exists for communication graphs with fewer than 3m+1 nodes or less than 2m+1 connectivity. While some of these results had previously been proved, the new proofs are much simpler, provide considerably more insight, apply to more general models of computation, and (particularly in the case of clock synchronization) significantly strengthen the results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01843568
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A modular drinking philosophers algorithm (1993)
    Springer
    Distributed computing 6 (1993), S. 233-244 
    Details
    ISSN: 1432-0452
    Keywords: Dining philosophers ; Distributed algorithms ; Drinking philosophers ; Modularity ; Resource allocation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary A variant of the drinking philosophers algorithm of Chandy and Misra is described and proved correct in a modular way. The algorithm of Chandy and Misra is based on a particular dining philosophers algorithm and relies on certain properties of its implementation. The drinking philosophers algorithm presented in this paper is able to use an arbitrary dining philosophers algorithm as a subroutine; nothing about the implementation needs to be known, only that it solves the dining philosophers problem. An important advantage of this modularity is that by substituting a more time-efficient dining philosophers algorithm than the one used by Chandy and Misra, a drinking philosophers algorithm withO(1) worst-case waiting time is obtained, whereas the drinking philosophers algorithm of Chandy and Misra hasO(n) worst-case waiting time (forn philosophers). Careful definitions are given to distinguish the drinking and dining philosophers problems and to specify varying degrees of concurrency.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242711
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Relative complexity of algebras (1981)
    Springer
    Theory of computing systems 14 (1981), S. 193-214 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A simple algebraic model is proposed for measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with coding-independent limitations on the relative complexity of basic algebras.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01752396
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Relativization of questions about log space computability (1976)
    Springer
    Theory of computing systems 10 (1976), S. 19-32 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A notion of log space Turing reducibility is introduced. It is used to define relative notions of log space,ℒ A , and nondeterministic log space, . These classes are compared with the classes and which were originally defined by Baker, Gill, and Solovay [BGS]. It is shown that there exists a computable setA such that . Furthermore, there exists a computable setA such that and . Also a notion of log space truth table reducibility is defined and shown to be equivalent to the notion of log space Turing reducibility.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01683260
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    A difference in expressive power between flowcharts and recursion schemes (1978)
    Springer
    Theory of computing systems 12 (1978), S. 205-211 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We show the existence of a single interpretation for which no flowchart produces the same results as a particular recursion scheme.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01776573
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...