We’re rewarding the question askers & reputations are being recalculated! Read more.

Questions tagged [distributed-systems]

Questions about the challenges of solving problems with multiple cooperating but separate agents.

Filter by
Sorted by
Tagged with
2
votes
0answers
27 views

Distributed Computing: Persistent Data Structures in Functional Programming versus Wait-Free Data Structures

Persistent (aka immutable) data structures in functional programming sidestep issues of shared memory mutual exclusion, and thus also issues such as data races that arise and which may be difficult to ...
2
votes
1answer
78 views

Lamport logical clock: why event occurs in a process with smaller pid is treated earlier?

In lamport's paper1, he define global local timestamp, which is composed of process id and local lamport timestamp. This timestamp is used to order all the events in a distributed system. The rule ...
2
votes
1answer
194 views

Lamport logical clock: what does partial mean in the concept of `Partial ordering`?

In lamport's paper[1], he define two concept The partial ordering and The totally ordering. What does partial mean in ...
2
votes
0answers
38 views

Algorithms / heuristics for a distributed sorting problem

The setting: There's a cluster of $k$ computers (= nodes). For simplicity, assume their hardware is identical. The network topology can be complicated, but let's simplify and assume it's a clique ...
1
vote
1answer
49 views

Can a distributed algorithm be serial?

Can a distributed algorithm be serial? For example if I have 3 distinct agents in a network would an algorithm that looks like this be considered a distributed algorithm? ...
1
vote
1answer
30 views

Prominent applications not suited for distributed computing [closed]

In the www I can find a lot of application examples suited for and benefitting a lot from distributed computing. Question: Are there applications which are not suited for distributed computing? If ...
0
votes
1answer
299 views

Vector clock :why Singhal Kshemkalyani differential technique require FIFO for message passing?

Singhal–Kshemkalyani’s differential technique is based on the observation that between successive message sends to the same process, only a few entries of the vector clock at the sender process ...
2
votes
0answers
69 views

Why is a primary node needed in pBFT algorithm for consensus?

Why is primary needed in pBFT algo? Since many issues of viewchange etc. come up because primary may be faulty - is it possible to have a version of pBFT which doesn't have nodes assigned as primary? ...
2
votes
1answer
88 views

What are the recents topics of research that combine both systems research and theoretical computer science?

I am an undergraduate majoring in Computer Science and Mathematics. For my undergraduate research, I would like to work on something that lies in the overlap between systems research and theoretical ...
0
votes
0answers
96 views

How is Eventual Consistency (EC) better than Strong Consistency (SC) when N = 3, R=W=2 when SC gives better consistency gurantee in same config?

In dynamo paper, it says that in production most of the users set N = 3, R = 2 and W = 2. ...
2
votes
0answers
126 views

Byzantine generals (n=3, m=1)

Leslie Lamport describes a algorithm to come to consensus for the case for n>3*m, there m is the number of traitors in ...
1
vote
0answers
56 views

Strong Uniform Total Order vs Weak Uniform Total Order

The definition for SUTO and WUTO is the following: Suto If some process TODelivers some message m before message mʹ, then a process TODelivers mʹonly after it has TODelivered m. And for WUTO ...
3
votes
1answer
122 views

What are the purposes of Reply messages in Lamport Algorithm for Mutual Exclusion?

After reading Lamport Algorithm for Mutual Exclusion, I can not understand the purposes of reply messages. I think they are not necessary because the assumption of the algorithms is that all messages ...
3
votes
1answer
156 views

Impossibility of Distributed Consensus with One Faulty Process

I'm reading Fischer et al.'s Impossibility of Distributed Consensus with One Faulty Process, and I don't quite follow 2 points: The first is in the proof of Lemma 3, pg. 378: Otherwise, $e$ was ...
0
votes
1answer
26 views

Bloom Filter which does not fit in RAM [closed]

Is it possible to efficiently create a bloom filter with 10^12 buckets on a single machine with 32GB of RAM and a hard drive. We can assume that the keys are already on the disk and are small in size?
0
votes
0answers
31 views

BFT algorithm perfo

Understand that BFT algorithms are always prepared for the worst possible circumstances and pays a price for this in terms of speed. Can one reasonably make the statement / assessment that non BFT ...
1
vote
1answer
190 views

How to compare distributed systems and big data

Are there scientific papers that compare distributed systems and big data processing systems? Big data processing systems can be batch processing systems or streaming big data processing systems. A ...
1
vote
0answers
30 views

Tendermint Consensus - Resilient up to 1/3 of Byzantine participants

Tendermint Consensus is resilient for up to 1/3 of Byzantine participants. Question: What actually happens after when the network hits the threshold of byzantine actors? Forking happens? Does ...
2
votes
1answer
127 views

Async Distributed Algorithm Time Complexity

In theory of distributed systems, I understand message complexity and time complexity are common performance measures, with the first being the number of messages sent in the overall execution of the ...
4
votes
0answers
315 views

Even distribution algorithm

Right now I am working on a distributed system that sends messages from single source to many nodes. It is necessary that certain messages are sent to the same node to ensure order of processing. ...
1
vote
0answers
40 views

Number of replicas needed for fault tolerance in state machine replication

I am trying to get my head around "State Machine Replication". I understand that it is a way to ensure resilience against failures. I have read that in order to provide fault tolerance against normal ...
2
votes
0answers
104 views

Are Synchronous Message Order and Total Message Order separate concepts?

I am currently studying this book on distributed systems. In the chapter on message ordering the authors appear to use the term total message ordering and synchronous message ordering interchangeably. ...
0
votes
0answers
86 views

a problem with Suzuki-Kasami mutex algorithm

I have some sort of a misunderstanding regarding the Suzuki-Kasami distributed mutex algorithm. I am writing my question here because I failed on gaining access to the original paper. I will call ...
0
votes
1answer
77 views

Chord protocol - How should I go about mapping nodes to placeholders on the ring?

In the real world, how is a node mapped to the position on the ring, Each nodes's IP address is hashed using SHA-1 hashing algorithm which will produce this hash - 73.128.154.69 hashed into ...
1
vote
0answers
123 views

bakery algorithm, switching up the condition

I'm currently studying the Bakery Algorithm. I understand it for what it is but now I want to switch it up a bit. If we changed the < in the 2nd ...
2
votes
1answer
37 views

Soft question: program result verification

Let's say there's a cloud computing service that allows people to run arbitrary programs and get the results. The idea being that your machine is too slow, and you don't want to overwhelm it. If your ...
1
vote
2answers
99 views

Are consensus (and atomic broadcast) protocols limited by single node's resources?

The main question is the following: When designing a system supporting atomic broadcast, can it be proved theoretically that the performance & scalability dimensions (i.e. latency, throughput, ...
1
vote
0answers
10 views

Where can I find practice for given atom instructions, implement ME

I'm trying to practice for my upcoming distributed systems test. My teacher said that their will be a problem where he'll give us atomic instructions and we're going to have to implement Mutual ...
1
vote
1answer
42 views

Enforcing application layer consensus on top of a distributed consensus protocol

If I understand correctly, the term "consensus" in distributed consensus algorithms means that all the participants ("peers") achieve a common understanding of some data value. Different algorithms ...
0
votes
1answer
215 views

What us difference between distributed computing and workgroup computing?

According to the definition, distributed computing means to distributed a problem among different users while workgroup computing means to work on a problem by different users. So what's the ...
1
vote
0answers
199 views

Distributing Neural Network Training World-Wide Using Blockchain?

I just finished reading a white-paper from a recent AI startup. The company, Deep Brain Chain, wants to distribute neural network training over computers worldwide, using blockchain technology. Here ...
3
votes
1answer
743 views

How are lamport timestamps useful in practice?

I am reading Lamport's paper titled Time, clocks, and the ordering of events in a distributed system I understand what's in there more or less, but I am confused whether Lamport timestamps on their ...
2
votes
1answer
70 views

FLP Impossiblity Result assumption of $C_1 = e'(C_0)$

FLP86's famous proof regarding impossibility of async distributed processes with a single fault assumes in the proof of the third lemma the existence of an event $e'$ such that the neighbor ...
6
votes
1answer
2k views

Why are forks in the Blockchain eventually resolved?

I'm reading Wattenhofer's The Science of the Blockchain. On page 87, he states the following thoerem: Theorem 7.22. Forks are eventually resolved and all nodes eventually agree on which is the ...
0
votes
1answer
74 views

Question about IO automaton

I'm currently reading Nancy Lynch book about distributed systems, chapter about IO automaton. And I have following questions related to book exercise 8.13(c). We are given some automaton A with sig(A)...
3
votes
1answer
198 views

Is it possible to write a wait free leader election algorithm?

I want to understand if there exists an algorithm which is wait free and operates on non-shared memory, asynchronously. Finally I want to know how to derive the consensus number of this algorithm. ...
2
votes
1answer
50 views

Sequential History in Herlihy and Wing's Linearizability paper

I've been reading Herlihy and Wing's paper Linearizability: A Correctness Condition for Concurrent Objects (ACM Transactions on Programming Languages and Systems, 12(3):463–492, 1990; PDF) and ...
3
votes
1answer
67 views

affinity based static load balancing

I am trying to find a good model the following problem: Given a collection of work packets x, y, z, ..., and a collection of worker nodes ...
-1
votes
1answer
108 views

Source code for Network File System [closed]

I am doing a small project which explains how operations (file open, file write etc.) are done in client side and server side in network File system. Can anyone help me out providing its source code ...
4
votes
2answers
218 views

Can we have a strictly monotonically increasing/decreasing sequence generated by a distributed system?

Just what the title says. Can we have a strictly monotonically increasing/decreasing sequence generated by a distributed system (without a single point of failure)? My current thoughts are that this ...
1
vote
1answer
276 views

Does Paxos consensus algorithm scale linearly?

I'm trying to build a P2P web application using Paxos to obtain a consensus value. How well does Paxos scale? linearly? or what kind of distribution can you expect? E.g. in using 10 to 10,000 users ...
2
votes
0answers
50 views

Auction website with Paxos consensus algorithm

As a project, I'm trying to construct a P2P auction web application with paxos in a high latency environment. The idea is that each user visiting the website will keep a small log file with the ...
1
vote
1answer
43 views

Verifying execution of code in trustless environment

Let us assume I have a Program P running on remote computer generating output O. Without trusting the remote environment and not having to verify the output O, is there is a way to validate that ...
0
votes
1answer
215 views

sequential consistency is not composable

I am studying for my exam in Distributed Systems course. And i have one question that i do not really understand. This is the question: ...
2
votes
1answer
108 views

Theory of message complexity analysis of distributed systems

Inspired by this post, I thought it would be a good idea to ask an analogous question in the context of distributed systems - While most of us are familiar with the notion of Time Complexity as a ...
2
votes
1answer
111 views

Consensus anomaly about read-write registers and test&set

I read this answer below and got into another question. Why is the consensus number for test-and-set, 2? I also read that read/write registers have consensus number 1. But I see that in test&...
-2
votes
1answer
33 views
0
votes
0answers
50 views

Name for pattern of addressing items by sequence-of-creation

I'm looking for the name of a particular pattern, and/or resources (articles) on its usage. The context of the pattern is a journalling system to operate on some collection, as in the example given ...
1
vote
0answers
455 views

How to use version vectors to decide which value to keep?

I am trying to understand how to build an eventually consistent KV store. It's just a learning experiment. Let's only consider one value which stores a fruits list. We have 2 servers, 2 clients, N=2, ...
0
votes
0answers
27 views

Retroactively ordering actors' concurrent activity on disjoint sections of a data-structure

Hi! I'm new here, a terrible computer-scientist, and have no idea what I'm doing; I'm more expecting / hoping for links to research on algorithms or data-structures that contribute to problems like ...