Questions tagged [distributed-systems]
Questions about the challenges of solving problems with multiple cooperating but separate agents.
415 questions
0 votes
0 answers
19 views
Looking for a model of parametrized rendez-vous communication
I'm looking for papers on some model close enough to the one I'm studying right now. The model is defined as follow: We have an alphabet of actions $\Sigma$ with two rendez-vous communication actions $...
- 11
0 votes
0 answers
23 views
What is the difference between coordination-free, wait,free, and high availability
I keep coming across the terms coordination-free, wait-free, and high availability in distributed systems and concurrency literature, but I’m not sure how they differ.
- 1
0 votes
0 answers
48 views
Why doesn't postgres have its own coordination layer - why does it rely on applicaiton logic to make the 2PC?
When making sure we have consistency across multiple postgres nodes - why do I have to handle this coordination layer in my application logic using the 2PC unlike in other databases? Grok and claude ...
- 1
0 votes
0 answers
32 views
Distributed algorithms that uses Multiple-producer Single-consumer data structure
I'm working on my thesis that proposes some distributed lock-free MPSCs using the RMA programing model. I'm currently in the process of benchmarking. The thing is, I want to benchmark my algorithms ...
0 votes
0 answers
34 views
Does consistency models also include the ordering of read operations?
I've been reading and exploring different types of consistency models. I mainly refer to this one: https://jepsen.io/consistency/models In many blogs or textbooks, when we discuss inconsistencies, we ...
2 votes
1 answer
59 views
Do bisimilar binary session types share subtypes?
If two binary session types $S_1$ and $S_2$ are bisimilar, are all subtypes of $S_1$ also subtypes of $S_2$ and vice versa?
- 123
1 vote
1 answer
87 views
FLP Impossibility Result: Uniqueness of schedule application
In the proof of Lemma 2 in the FLP impossibility paper, the authors use the fact that if a single process fails after inputting distinct messages into the message buffer and then failing, any schedule ...
- 203
0 votes
1 answer
75 views
Find the minimum number of send/recv actions in directed communication graph
Given p processes and n packages. Every process contains k = n / p distinct packages. Now, I ...
- 101
1 vote
0 answers
131 views
Were the Space Shuttle computers truly MISD (Multiple Instruction, Single Data)?
I’m trying to understand whether the Space Shuttle flight control computers, which are sometimes referred to as MISD (Multiple Instruction, Single Data), truly fit this classification. According to ...
- 11
1 vote
0 answers
44 views
RAFT in the presence of a network partition disproves CAP Theorem?
RAFT gives consensus, and multiple rounds of consensus gives Linearizability(Strong Consistency). CAP theorem states you cannot have Consistency in the presence of Network Partitions if you definitely ...
- 111
0 votes
1 answer
135 views
Is there a "leader election" algorithm for communication via shared disks?
I've been trying to design such an algo with TLA+ formal prover, that is till I realized that it's a case of "simple-looking problem but with soooo many corner-cases", which screams of "...
- 121
2 votes
2 answers
130 views
A pedagogic review on the advantage/drewbacks of distributed computing
I need to understand the motivations behind distributed computing, namely the fact to perform a computation by making physically separated computer, connected by communication links, work together. I ...
- 137
1 vote
1 answer
165 views
What happens when two different nodes have the same Lamport clock ID
With Lamport clocks, each node keeps its own counter. Before sending a message, a node increments its counter by one: LC(A)=LC(A)+1, and sends ...
- 123
1 vote
1 answer
61 views
Topological/metric space formed by behaviors of distributed system: Safety and Liveness
In the book A Science of Concurrent Programs Leslie Lamport describes alternative way how to look at safety and liveness properties in distributed algorithms. A.5 Another Way to Look at Safety and ...
- 113
1 vote
0 answers
68 views
Why is Bully algorithm in leader election considered synchronous?
The original paper of Bully algorithm [1] does not make any assumption of a synchronous processing. But I see few lectures explicitly call it suitable for synchronous processing. I am not sure why do ...
- 11