Questions tagged [distributed-systems]

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

Filter by
Sorted by
Tagged with
0 votes
0 answers
104 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. ...
user avatar
0 votes
0 answers
38 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 ...
user avatar
  • 111
0 votes
0 answers
121 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 ...
user avatar
0 votes
1 answer
277 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 ...
user avatar
  • 1
0 votes
0 answers
52 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 ...
user avatar
0 votes
0 answers
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 ...
user avatar
0 votes
0 answers
128 views

Understanding leslie lamport's spacetime diagram with tick lines

I am trying to understand tick lines in Fig 2 on Page 2 of "Time, Clocks, and the Ordering of Events in a Distributed System" paper [1]. Below are 2 things which I did not understand What is the ...
user avatar
  • 101
0 votes
0 answers
42 views

What's a good method to decide wheter distributed or parallel computing?

I've already programed a grammatical evolution on GPU with a very satisfactory result (an improvement on time of about 140% with relative small datasets, expecting better results whith big ones). ...
user avatar
  • 211
0 votes
0 answers
175 views

Spanning-Tree-Protocol and BFS? (Distributed Computing)

Given is graph with networks and bridges/switches. We know, the root Bridge is the bridge with the minimal Bridge-ID. The connections between every bridge and network is 1. In the lecture slides they ...
user avatar
  • 219
0 votes
0 answers
169 views

Distributed MST in $O(n \log \log n)$

I'm facing the following problem: Describe a distributed MST algorithm in time $O(n \log \log n)$ I've managed to think of the following, Run GHS(Gallager, Humblet and Spira) algorithm, till there ...
user avatar
0 votes
0 answers
40 views

What are networking technologies to distribute the file faster with storing on more replicas?

Question: Suppose you launch a job on 10,000 machines in your own data centre. The job is slow to start because all the machines are trying to load the same large executable file. Name two networking ...
user avatar
0 votes
0 answers
61 views

What is the probability distribution of arrival times in a distributed system?

I'm going to simulate an asynchronous distributed system. In a distributed system, when a node sends a message, after $\Delta t$ seconds the message reaches to its destination. My Question: What is ...
user avatar
  • 263
0 votes
0 answers
111 views

When to send a message on distributed systems emulating a FIFO network?

We designed in the lecture of Distributed algorithm an algorithm to emulate a FIFO network as far as an asynchronous network isn't unavoidably FIFO. Yet I have some difficultes to understand the ...
user avatar
0 votes
0 answers
58 views

Reference Request: Distributed Systems Systems

I recently finished Operating System Concepts. As a follow-up for self-teaching, I am looking for a book on distributed systems (not theory). I've found Tanenbaum's text but it has rather poor reviews....
user avatar
  • 2,190
0 votes
0 answers
122 views

Distributed Algorithm for Minimum Cost Maximum Matching in General Graphs

What are the fastest distributed algorithms for minimum cost maximum matching in general graphs? I found two papers that talk about approximation algorithms but I want algorithms that solve the ...
user avatar
0 votes
0 answers
70 views

Explanation of pilot jobs in distributed/grid computing

I'm reading into grid systems/distributed systems and came across pilot jobs that I can't find a decent explanation for. The wikipedia page is not understandable to me. I know multi-level schemes ...
user avatar
  • 9
0 votes
1 answer
58 views

simple lower bound for constructing a Spanning tree

i have to demonstrate that under the assumptions{Bidirectional Links, Total Reliability (no error during the execution), Connectivity, Distincts ids values, Multiple inititators (entities that starts ...
user avatar
0 votes
1 answer
410 views

Distribution algorithm according to weighted parameters (with a min-max constraint)

I'm trying to solve the following problem related to distribution- I have a list L of items (I1, I2,....In) sorted in order of importance, I1 being the most important. Each item has multiple tags ...
user avatar
  • 103
0 votes
1 answer
467 views

Static access pattern in Distributed Databases

The access patterns of user requests may be static, so that they do not change over time, or dynamic. It is obviously considerably easier to plan for and manage the static environments than would ...
user avatar
0 votes
3 answers
1k views

Computing the intersection of N sets over an M-element universe

Suppose I have $N$ sets $S_1,\dots,S_N$ each with elements from set $\{1,\dots,M\}$. 1.) What is a good algorithm to find $S_1\cap\dots\cap S_N$? 2.) I am also looking for a good parallel and a good ...
user avatar
  • 2,824
-1 votes
1 answer
239 views

Rational of why Paxos only issues new values if its value is the largest one in the majority that he can see?

I was studying Paxos from: http://research.microsoft.com/en-us/um/people/lamport/pubs/paxos-simple.pdf Recall that Paxos is a distributed system algorithm with the goal that the processes ...
user avatar
-1 votes
1 answer
56 views

If primary server's UTC source fails, how will synchronization be possible in NTP(network time protocol)?

If a primary server's UTC source fails, then it can become a stratum 2 secondary server. If a secondary server's normal source of synchronization fails or becomes unreachable, then it may synchronize ...
user avatar
-1 votes
1 answer
175 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 ...
user avatar
-1 votes
1 answer
141 views

TCP repeated acknowledgement

My professor has asked this (exam) question and it actually makes no sense to me: TCP offers a reliable, bidirectional byte stream over the best effort packet delivery in IP. For reliability, a ...
user avatar
  • 461
-1 votes
1 answer
33 views

How does clients observe different replicas and stale data even if the replicas include same set of updates?

I am studying about gossip architecture. This is gossip architecture-: Gossip architecture provides 2 guarentees-: 1)Each client gets consistent service over time(meaning even if clients use ...
user avatar
-2 votes
1 answer
683 views

Both shared-memory and distributed-memory

As you see in the following picture its a shared-memory architecture which has been modeled in a form of complete graph. Why we can consider the following architecture (which is a complete graph) both ...
user avatar
-2 votes
1 answer
34 views

Aren't the servers that store MYSQL database in Facebook down for maintenance ever as Facebook is always on? [closed]

I have never seen my account not being able to login!
user avatar
-2 votes
1 answer
628 views

MIS algorithm for Tree in O(log* n) time

I know Distributed Graph Coloring algorithm in O(log* n) which is given at P11: Vertex Coloring Same for Maximal Independent Set [MIS] they gave remark like algorithms exist in O(log* n) time at P70: ...
user avatar
-3 votes
1 answer
731 views

What is the difference between masking and tolerating failures?

Distributed Systems 5ed by Coulouris says on p21-22 1.5.5 Failure handling Detecting failures: Some failures can be detected. For example, checksums can be used to detect corrupted data in a ...
user avatar
  • 1

1
4 5 6 7
8