Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/highly-concurrent-logically-synchronous-multicast-Xj6v1F5Od1
References (38)
-
T. Joseph, K. Birman (1990)
Reliable broadcast protocols -
L. Lamport (1978)
Time, clocks, and the ordering of events in a distributed systemCommun. ACM, 21
-
M. Fischer, N. Lynch, M. Paterson (1985)
Impossibility of distributed consensus with one faulty processJ. ACM, 32
-
Jennifer Welch, N. Lynch (1989)
Synthesis of Efficient Drinking Philosophers Algorithms -
K. Goldman, N. Lynch (1994)
Quorum consensus in nested-transaction systemsACM Trans. Database Syst., 19
-
S. Saib, R. Fritz (1983)
The ada programming languageIEEE Computer Society
-
M. Fischer, N. Lynch, M. Paterson (1983)
Impossibility of distributed consensus with one faulty process -
M. Herlihy (1988)
Impossibility and universality results for wait-free synchronization -
lo In a real implementation, one might have the system determine S based on the impossibility of implementation in face of crashes -
Time constrained automata. Unpublished manuscript -
J. Welch, L. Lamport, N. Lynch (2016)
A lattice-structured proof of a minimum spanning -
K. Goldman (1990)
Distributed algorithm simulation using input/output automata -
I. Pyle (1985)
The ada programming language -
K. Goldman, N. Lynch (1990)
Modelling shared state in a shared action model[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
-
N. Lynch, M. Tuttle (1987)
Hierarchical correctness proofs for distributed algorithms -
Rahim Ramezanian (1978)
Communicating sequential processesCommun. ACM, 21
-
A. Fekete, N. Lynch (1990)
The Need for Headers: An Impossibility Result for Communication over Unreliable Channels -
R. Back, R. Kurki-Suonio (1988)
Distributed cooperation with action systemsACM Trans. Program. Lang. Syst., 10
-
A. Fekete, N. Lynch, L. Shrira (1987)
A Modular Proof of Correctness for a Network Synchronizer (Research Summary) -
F. Schneider (1982)
Synchronization in Distributed ProgramsACM Trans. Program. Lang. Syst., 4
-
R. Bagrodia (1987)
A Distributed Algorithm to Implement N-Party Rendevouz -
Gael Buckley, A. Silberschatz (1983)
An Effective Implementation for the Generalized Input-Output Construct of CSPACM Trans. Program. Lang. Syst., 5
-
(1987)
On the design of high performance distributed systems -
K. Goldman, N. Lynch (1987)
Quorum consensus in nested transaction systems -
D. Dolev, C. Dwork, L. Stockmeyer (1983)
On the minimal synchronism needed for distributed consensus24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
-
D Dolev, C Dwork, L Stockmeyer (1987)
On the minimal synchronism needed for distributed consensusJ ACM, 34
-
A Fekete, N Lynch (1990)
CONCUR'90, Theories of concurrency: unification and extension -
Nancy Lynch, Michael Merritt, W. Weihl, Alan Fekete (1993)
Atomic Transactions -
Seif Haridi (1992)
Distributed Algorithms, 647
-
B. Awerbuch (1985)
Complexity of network synchronizationJ. ACM, 32
-
R. Bagrodia (1986)
A Distributed Algorithm to Implement the Generalized Alternative Command of CSP -
N. Lynch, Michael Merritt (1986)
Introduction to the Theory of Nested Transactions -
B. Bloom (1987)
Constructing two-writer atomic registersIEEE Trans. Computers, 37
-
K. Birman, T. Joseph (1987)
Reliable communication in the presence of failuresACM Trans. Comput. Syst., 5
-
(1986)
A revised version will appear in Theoretical Computer Science -
N. Lynch, Y. Mansour, A. Fekete (1988)
Data link layer: two impossibility results -
N. Lynch, M. Tuttle (1989)
An introduction to input/output automataCWI quarterly, 2
-
J. Misra (1986)
Distributed discrete-event simulationACM Comput. Surv., 18
- Publisher
- Springer Journals
- Copyright
- Copyright © 1991 by Springer-Verlag
- Subject
- Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/BF01784720
- Publisher site
- See Article on Publisher Site
Abstract
We define thelogically synchronous multicast problem which imposes a natural and useful structure on message delivery order in an asynchronous system. In this problem, a computation proceeds by a sequence ofmulticasts, in which a process sends a message to some arbitrary subset of the processes, including itself. A logically synchronous multicast protocol must make it appear to every process as if each multicast occurs simultaneously at all participants of that multicast (sender plus receivers). Furthermore, if a process continually wishes to send a message, it must eventually be permitted to do so.
Journal
Distributed Computing – Springer Journals
Published: May 11, 2005