#### Filter Results:

- Full text PDF available (97)

#### Publication Year

1981

2017

- This year (3)
- Last 5 years (28)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
- J. ACM
- 1990

This paper introduces a general formulation of<?Pub Fmt italic>atomic snapshot memory<?Pub Fmt /italic>, a sharedmemory partitioned into words written(<?Pub Fmt italic>updated<?Pub Fmt /italic>) by individual processes, orinstantaneously read (<?Pub Fmt italic>scanned<?Pub Fmt /italic>) in itsentirety. This paper presents three wait-free implementations of… (More)

- Elizabeth Borowsky, Eli Gafni
- STOC
- 1993

Demarcation of the border between solvable and unsolvable distributed tdis under various models is the holy grail of the theory of distributed computing. Oneof the most celebrated of theseresults is [6] (FLP) which established the impossibility of asynchronous consensus that can tolerate a single undetected fail-stop processor. This paper generalizes FLP to… (More)

We consider the problem of maintaining communication between the nodes of a data network and a central station in the presence of frequent topological changes as, for example, in mobile packet radio networks. We argue that flooding schemes have significant drawbacks for such networks, and propose a general class of distributed algorithms for establishing… (More)

- Elizabeth Borowsky, Eli Gafni
- PODC
- 1993

This paper investigates a new shared-memory model called immediate atomic snapshot memor~. It is an extension of atomic snapshot memory in which a write operation in addition to ~vriting, also returns an atomic snapshot of the memory. Unlike regular atomic snapshot, immediate snapshot is guaranteed to closely follow the write operation. This model was… (More)

- Eli Gafni
- PODC
- 1998

This paper presents a new family of models of distributed-computation which combines features from synchronous, asynchronous, and failure-detectoraugmented systems. Like synchronous systems, computation in this family of models evolves in rounds, and communication missed at a round is lost. Unlike synchronous systems, information that is missed at a round… (More)

- Eli Gafni, Leslie Lamport
- Distributed Computing
- 2000

We present an algorithm, called Disk Paxos, for implementing a reliable distributed system with a network of processors and disks. Like the original Paxos algorithm, Disk Paxos maintains consistency in the presence of arbitrary non-Byzantine faults. Progress can be guaranteed as long as a majority of the disks are available, even if all processors but one… (More)

- Valmir Carneiro Barbosa, Eli Gafni
- ACM Trans. Program. Lang. Syst.
- 1987

Let <italic>G</italic> be a connected undirected graph in which each node corresponds to a process and two nodes are connected by an edge if the corresponding processes share a resource. We consider distributed computations in which processes are constantly demanding all of their resources in order to operate, and in which neighboring processes may not… (More)

- Dimitri P. Bertsekas, Eli Gafni, Robert G. Gallager
- IEEE Trans. Communications
- 1984

We propose a class of algorithms for finding an optimal quasistatic routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum ,delay routing. Their main feature is that they utilize second… (More)

This paper is concerned with the problem min {f(x)lx X} where X is a convex subset of a linear space H, and f is a smooth real-valued function on H. We propose the class of methods Xk+l P(xkakgk), where P denotes projection on X with respect to a Hilbert space norm II’ [I, gk denotes the Frechet derivative of f at xk with respect to another Hilbert space… (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)