Open Access
in Distributed Programs
Fred B. Schneider
- 01 Jan 1982
TL;DR: The technique can be used to solve synchronization problems directly, to implement new synchronization mechanisms, and to construct distributed versions of existing synchronization mechanisms.
read more
Abstract: A technique for solving synchronization problems in distributed programs is described. Use of this technique in environments in which processes may fail is discussed. The technique can be used to solve synchronization problems directly, to implement new synchronization mechanisms (which are presumably well suited for use in distributed programs), and to construct distributed versions of existing synchronization mechanisms. Use of the technique is illustrated with implementations of distributed semaphores and a conditional message-passing facility.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On heuristics for optimal configuration of hierarchical distributed monitoring systems
TL;DR: The heuristics for obtaining near-optimal grouping of monitoring units in a hierarchical distributed monitoring system are studied and simulation of heuristic algorithms for mesh and hypercube networks are presented.
10
•Dissertation
Architectures et systèmes distribués tolérants aux fautes
Christine Morin
- 05 Mar 1998
TL;DR: In this paper, the authors present les travaux de recherche that jai menes sur la problematique de the tolerance aux fautes dans les architectures and systemes distribues entre 1987 and 1998.
5
On-time data exchange in fully-parallelized co-simulation with conservative synchronization
Asim Munawar,Takeo Yoshizawa,Tatsuya Ishikawa,Shuichi Shimizu +3 more
- 08 Dec 2013
TL;DR: A technique for distributed discrete event co-simulation that exploits parallel computing and distributed simulation with an advanced synchronization technique to overcome all of the constraints of simulation speed, fidelity, compatibility, and scalability is presented.
Distributed System Fuzzing
04 May 2023
TL;DR: Mallory as discussed by the authors is a framework for grey-box fuzzing of distributed systems that dynamically constructs Lamport timelines of the system behaviour, abstracts these timelines into happens-before summaries, and introduces faults guided by its real-time observation of the summaries.
Adaptive resolution control in distributed cyber-physical system simulation
Dylan Pfeifer,Andreas Gerstlauer,Jonathan W. Valvano +2 more
- 11 Dec 2016
TL;DR: This work offers a general means for adaptive resolution control using the Kahn Process Network and Interpolated Event method of parallel and distributed simulation and results demonstrate reduction in messaging traffic for adaptively controlled resolution cases versus fixed resolution cases with controllable tradeoffs in speedup versus accuracy.
1
References
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.