WorldCat Identities

Moran, S.

Overview
Works: 59 works in 115 publications in 1 language and 201 library holdings
Roles: Author
Publication Timeline
.
Most widely held works by S Moran
The Lie ring associated with certain groups by Shlomo Moran( Book )

5 editions published in 1965 in English and held by 66 WorldCat member libraries worldwide

A lower bound on wait-free counting by Shlomo Moran( Book )

4 editions published in 1993 in English and held by 12 WorldCat member libraries worldwide

Abstract: "A couting protocol (mod m) consists of shared memory bits -- referred to as the counter -- and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be executed by many processes concurrently. It is required to satisfy a very weak correctness requirement, namely: the counter is required to show a correct value only in quiescent states -- states in which no process is incrementing the counter. Special cases of counting protocols are 'counting networks' [AHS91] and 'concurrent counters' [MTY92]. We consider the problem of implementing a wait-free counting protocol, assuming that the basic atomic operation of a process is a read-modify-write on a single bit. Let flip(Pr) be the maximum number of times a single increment operation changes the counter bits in a couting protocol Pr. Our main result is: In any wait-free counting protocol Pr which counts modulo m, m divides 2[superscript flip(Pr)]. Thus, flip(Pr) [> or =] log m and m is a power of 2. This result provides interesting generalizations of lower bounds and impossibility results for counting and smoothing networks."
The distributed bit complexity of the ring : from the anonymous to the non-anonymous case by H. L Bodlaender( Book )

4 editions published in 1988 in English and held by 7 WorldCat member libraries worldwide

An extended impossibility result for asynchronous complete networks by Shlomo Moran( Book )

7 editions published between 1986 and 1987 in English and held by 7 WorldCat member libraries worldwide

Uniform self-stabilizing leader election by Shlomi Dolev( Book )

4 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide

Tight lower and upper bounds for some distributed algorithms for a complete network of processors by E Korach( Book )

7 editions published between 1983 and 1986 in English and held by 5 WorldCat member libraries worldwide

Uniform self-stabilizing leader election by Shlomi Dolev( Book )

3 editions published in 1993 in English and Undetermined and held by 5 WorldCat member libraries worldwide

Abstract: "A distributed system is self-stabilizing if it can be started in any possible global state. Once started the system regains its consitency by itself, without any kind of an outside intervention. The self-stabilization property makes the system tolerant to faults in which processors crash and then recover spontaneously in an arbitrary state. When the intermediate period in between one recovery and the next crash is long enough the system stabilizes. A distributed system is uniform if all processors with the same number of neighbors are identical. In this work we study uniform self-stabilizing protocols for leader election under read/write atomicity. Our protocols use randomization to break symmetry. We first introduce a novel technique called the sl-game method for analyzing the performance of randomized distributed protocols. Then we present two protocols for the case where each processor in the system can communicate with all other processors, and analyze their performance using the sl-game technique."
Impossibility results in the presence of multiple faulty processes by Gadi Taubenfeld( Book )

4 editions published between 1988 and 1989 in English and held by 4 WorldCat member libraries worldwide

Communication versus computation in fault tolerant broadcast protocols by Shlomo Moran( Book )

3 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide

Slowing sequential algorithms for obtaining fast distributed and parallel algorithms : maximum matchings by Baruch Schieber( Book )

3 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide

Generalized lower bounds derived from Hastad's main lemma by Shlomo Moran( Book )

3 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide

Gap theorems for distributed computation by Shlomo Moran( Book )

3 editions published between 1986 and 1987 in English and held by 4 WorldCat member libraries worldwide

Tight bounds on the round complexity of distributed 1-solvable tasks by Ofer Biran( Book )

4 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide

Abstract: "A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was given in [BMZ]. In this paper we determine the number of rounds of communication that are required, in the worst case, by a protocol which 1-solves a given 1- solvable task T for n processors. We define the radius R(T) of T, and show that if R(T) is finite, then this number is [theta][(log[subscript n]R(t)); more precisely, we give a lower bound of log [subscript (n-1)R(T), and an upper bound of 2+[log (subscript n-1)R(T)]. The upper bound implies, for example, that each of the following tasks: renaming, order preserving renaming ([ABDKPR]) and binary monotone consensus ([BMZ]) can be solved in the presence of one fault in 3 rounds of communications. All previous protocols that 1-solved these tasks required [omega](n) rounds. The result is also generalized to tasks whose radii are not bounded, e.g., the approximate consensus and its variants ([DLPSW, BMZ])."
Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks by Makhon ṭekhnologi le-Yiśraʼel Ṭekhniyon( Book )

3 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide

An 1.44 ... NlogN algorithm for distributed leader finding in bidirectional rings of processors by Shlomo Moran( Book )

3 editions published between 1985 and 1986 in English and held by 4 WorldCat member libraries worldwide

On the length of optimal TSP circuits in sets of bounded diameter by Shlomo Moran( Book )

2 editions published in 1982 in English and held by 3 WorldCat member libraries worldwide

Estimating topological change in fully connected mobile networks : a least upper bound on the worst case by Y Gold( Book )

2 editions published in 1984 in English and held by 3 WorldCat member libraries worldwide

On the limitation of the global time assumption in distributed systems : (extended abstract) by Ulf Abraham( Book )

2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide

The Wakeup problem : extended abstract by Yale University( Book )

3 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide

We study a new problem, the wakeup problem that seems to be very fundamental in distributed computating. We present efficient solutions to the problem, and show how these solution can be used to solve the consensus problem, the leader election problem, and other related problems. The main question we try to answer is, how much memory is needed to solve the wakeup problem? We assume a model that captures important properties of real systems that have been largely ignored by previous work on cooperative problems. (kr)
Extremal problems on permutations under cyclic equivalence by Makhon ṭekhnologi le-Yiśraʼel Ṭekhniyon( Book )

3 editions published in 1984 in English and held by 3 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.80 (from 0.75 for Uniform se ... to 0.92 for Uniform se ...)

Alternative Names
Moran, S.

Schlomo Moran israelischer Informatiker

Shlomo Moran

Shlomo Moran informatico israeliano

Shlomo Moran informaticus uit Israël

Shlomo Moran Israeli computer scientist (b.1947)

Моран, Шломо

Languages
English (71)