#### Filter Results:

- Full text PDF available (83)

#### Publication Year

1992

2017

- This year (2)
- Last 5 years (43)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ulrich Schmid, Klaus Schossmaier
- Distributed Computing
- 2001

We present a new fault-tolerant intersection function ${\boldmath{\cal F}}$ , which satisfies the Lipschitz condition for the uniform metric and is optimal among all functions with this property. ${\boldmath{\cal F}}$ thus settles Lamport's question about such a function raised in [5]. Our comprehensive analysis reveals that ${\boldmath{\cal F}}$ has… (More)

- Ulrich Schmid, Bettina Weiss, Idit Keidar
- SIAM J. Comput.
- 2009

We provide a suite of impossibility results and lower bounds for the required number of processes and rounds for synchronous consensus under transient link failures. Our results show that consensus can be solved even in presence of O(n) moving omission and/or arbitrary link failures per round, provided that both the number of affected outgoing and incoming… (More)

- Martin Biely, Peter Robinson, Ulrich Schmid
- SIROCCO
- 2012

We study distributed computation in synchronous dynamic networks where an omniscient adversary controls the unidirectional communication links. Its behavior is modeled as a sequence of directed graphs representing the active (i.e. timely) communication links per round. We prove that consensus is impossible under some natural weak connectivity assumptions,… (More)

- Ulrich Schmid, Klaus Schossmaier
- Real-Time Systems
- 1997

In this paper, we develop and analyze a simple interval-based algorithm suitable for fault-tolerant external clock synchronization. Unlike usual internal synchronization approaches, our convergence function-based algorithm provides approximately synchronized clocks maintaining both precision and accuracy w.r.t. external time. This is accomplished by means… (More)

- Matthias Függer, Ulrich Schmid, Gottfried Fuchs, Gerald Kempf
- 2006 Sixth European Dependable Computing…
- 2006

This paper introduces a simple fault-tolerant tick generation algorithm based on Srikanth & Toueg's consistent broadcast primitive that can be directly implemented in VLSI using asynchronous digital logic. The need for adaption originates from two peculiarities of hardware implementations: (i) Fine-grained parallel asynchronous computations, which… (More)

- Martin Hutle, Dahlia Malkhi, Ulrich Schmid, Lidong Zhou
- SSS
- 2006

- Martin Biely, Peter Robinson, Ulrich Schmid
- OPODIS
- 2009

- Ulrich Schmid, Bettina Weiss, John M. Rushby
- ICDCS
- 2002

This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of (Gray, 1978). Instead of using randomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that… (More)

- Christof Fetzer, Ulrich Schmid, Martin Süßkraut
- 25th IEEE International Conference on Distributed…
- 2004

It has long been known that the consensus problem cannot be solved deterministically in completely asynchronous distributed systems, i.e., systems (1) without assumptions on communication delays and relative speed of processes and (2) without access to real-time clocks. In this paper, we define a new asynchronous system model. Instead of assuming reliable… (More)

- Josef Widder, Ulrich Schmid
- Distributed Computing
- 2009

We present a novel partially synchronous system model, which augments the asynchronous model by a (possibly unknown) bound Θ on the ratio of longest and shortest end-to-end delays of messages simultaneously in transit. An upper bound on those delays need not exist, however, and even Θ may hold only after some unknown global stabilization time. Θ-algorithms… (More)