ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Electronic Resource
    Electronic Resource
    Fast and simple distributed consensus (1994)
    Springer
    Distributed computing 8 (1994), S. 59-64 
    Details
    ISSN: 1432-0452
    Keywords: Byzantine Agreement ; Distributed Consensus ; Distributed systems ; Early stopping ; Fault-tolerance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary The problem of fault-tolerant agreement is fundamental to distributed computing. When agreement is to be reached in spite of arbitrary behavior by faulty processors, this problem is calledDistributed Consensus. By requiring that the number of faulty processors be $$O(\sqrt n )$$ , wheren is the number of processors in the system, we are able to derive two new protocols forDistributed Consensus. Both are simple and use messages that are only one bit in length, and both provide forearly stopping: the fewer failures there are, the fewer rounds of communication are required. One protocol is optimal with respect to the number of rounds of communication required, and the other is asymptotically optimal with respect to the total number of message bits exchanged.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02280828
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Common knowledge and consistent simultaneous coordination (1993)
    Springer
    Distributed computing 6 (1993), S. 181-192 
    Details
    ISSN: 1432-0452
    Keywords: Byzantine agreement ; Common knowledge ; Distributed systems ; Consistent coordination ; Faulttolerance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary There is a very close relationship between common knowledge and simultaneity in synchronous distributed systems. The analysis of several well-known problems in terms of common knowledge has led to round-optimal protocols for these problems, includingReliable Broadcast, Distributed Consensus, and theDistributed Firing Squad problem. These problems require that the correct processors coordinate their actions in some way but place no restrictions on the behaviour of the faulty processors. In systems with benign processor failures, howrver, it is reasonable to require that the actions of a faulty processor be consistent with those of the correct processors, assuming it performs any action at all. We consider problems requiringconsistent, simultaneous coordination. We then analyze these problems in terms of common knowledge in several failure models. The analysis of these stronger problems requires a stronger definition of common knowledge, and we study the relationship between these two definitions. In many cases, the two definitions are actually equivalent, and simple modifications of previous solutions yield roundoptimal solutions to these problems. When the definitions differ, however, we show that such problems cannot be solved, even in failure-free executions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242706
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    On the use of registers in achieving wait-free consensus (1997)
    Springer
    Distributed computing 10 (1997), S. 117-127 
    Details
    ISSN: 1432-0452
    Keywords: Key words: Registers ; Consensus ; Wait-free computation ; Wait-free hierarchies ; Robustness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary.  The computational power of concurrent data types has been the focus of much recent research. Herlihy showed that such power may be measured by the type’s ability to implement wait-free consensus. Jayanti argued that this ability could be measured in different ways, depending, for example, on whether or not read/write registers could be used in an implementation. He demonstrated the significance of this distinction by exhibiting a nondeterministic type whose ability to implement consensus was increased with the availability of registers. We show that registers cannot increase the ability to implement wait-free consensus of any deterministic type or of any type that can, without them, implement consensus for at least two processes. These results significantly impact the study of the wait-free hierarchies of concurrent data types. In particular, the combination of these results with other recent work suggests that Jayanti’s h m hierarchy is robust for certain classes of deterministic types.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004460050029
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Causal memory: definitions, implementation, and programming (1995)
    Springer
    Distributed computing 9 (1995), S. 37-49 
    Details
    ISSN: 1432-0452
    Keywords: Memory consistency ; Causal memory ; Sequential consistency ; Distributed shared memory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01784241
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    facet.materialart.
    Unknown
    Detection of global state predicates (1991)
    In:  CASI
    Details
    Publication Date: 2019-06-28
    Description: The problem addressed here arises in the context of Meta: how can a set of processes monitor the state of a distributed application in a consistent manner? For example, consider the simple distributed application as shown here. Each of the three processes in the application has a light, and the control processes would each like to take an action when some specified subset of the lights are on. The application processes are instrumented with stubs that determine when the process turns its lights on or off. This information is disseminated to the control processes, each of which then determines when its condition of interest is met. Meta is built on top of the ISIS toolkit, and so we first built the sensor dissemination mechanism using atomic broadcast. Atomic broadcast guarantees that all recipients receive the messages in the same order and that this order is consistent with causality. Unfortunately, the control processes are somewhat limited in what they can deduce when they find that their condition of interest holds.
    Keywords: COMPUTER SYSTEMS
    Type: NASA-CR-189499 , NAS 1.26:189499 , TR-91-1221 , AD-A243444
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...