#### Filter Results:

- Full text PDF available (100)

#### Publication Year

1990

2017

- This year (7)
- Last 5 years (51)
- Last 10 years (91)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
- PODC
- 1998

We take a signiicant step toward unifying the synchronous, semi-synchronous, and asynchronous message-passing models of distributed computation. The key idea is the concept of a pseudosphere, a n e w combinatorial structure in which each process from a set of processes is independently assigned a value from a set of values. Pseudospheres have a number of… (More)

- Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal
- J. ACM
- 2001

This paper introduces and explores a new <italic>condition based</italic> approach to solve the consensus problem in asynchronous systems. The approach consists of identifying sets of input vectors, called <italic>conditions</italic>, for which it is possible to design a protocol solving consensus despite the occurrence of up to <italic>f</italic> process… (More)

- Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum
- Distributed Computing
- 2001

We present a shared memory algorithm that allows a set of f+1 processes to wait-free “simulate” a larger system of n processes, that may also exhibit up to f stopping failures. Applying this simulation algorithm to the k-set-agreement problem enables conversion of an arbitrary k-fault-tolerant{\it n}-process solution for the k-set-agreement problem into a… (More)

- Boaz Patt-Shamir, Sergio Rajsbaum
- STOC
- 1994

We consider the problem of clock synchronization with uncertain message delays and bounded clock drifts. To analyze this classical problem we introduce a characterization theorem for the tightest achievable estimate of the readings of a remote clock in any given execution of the system. Using this theorem, we obtain the rst optimal on-line distributed… (More)

- Yoram Moses, Sergio Rajsbaum
- SIAM J. Comput.
- 2002

This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysis of the consensus problem is performed and then applied to proving lower bounds and impossibility results for consensus in a number of familiar and less familiar models. The… (More)

- Hagit Attiya, Amir Herzberg, Sergio Rajsbaum
- SIAM J. Comput.
- 1996

The problem of achieving optimal clock synchronization in a communication network with arbitrary topology and perfect clocks (that do not drift) is studied. Clock synchronization algorithms are presented for a large family of delay assumptions. Our algorithms are modular and consist of three major components. The first component holds for any type of delay… (More)

- Shlomi Dolev, Sergio Rajsbaum
- J. Comput. Syst. Sci.
- 2003

This paper introdu es the notion of stability for a longlived onsensus system. This notion re e ts how sensitive to hanges the de isions of the system are, from one invoation of the onsensus algorithm to the next, with respe t to input hanges. Stable long-lived onsensus systems are proposed, and tight lower bounds on the a hievable stability are proved, for… (More)

- Yoram Moses, Sergio Rajsbaum
- PODC
- 1998

We introduce a simple notion of layering that provides a tool for defining submodels of a given model of distributed computation. We describe two layerings, the synchronic and the permutation layering, and show that they induce appropriate submodels of several asynchronous models of computation. The synchronic layering applies to the synchronous model too.… (More)

Solving agreement problems (such as consensus and <i>k</i>-set agreement) in asynchronous distributed systems prone to process failures has been shown to be impossible. To circumvent this impossibility, distributed oracles (also called unreliable failure detectors) have been introduced. A failure detector provides information on failures, and a failure… (More)