Skip to main content
Share Your Experience: Take the 2024 Developer Survey
13 votes
Accepted

Why is quiescent consistency compositional, but sequential consistency is not

Sorry for the late reply, but I've just found the question (questions, indeed). I am studying concurrency as well and I'll try to share some ideas with you. First, let's start with sequential ...
Shadow Template's user avatar
6 votes
Accepted

Help understanding Petersons Algorithm for N Processes

The rough intuition is that at least one contending process becomes stuck at each step of the stairway to heaven (AKA the critical section) when there are enough contenders present. Consequently there'...
Kai's user avatar
  • 908
4 votes
Accepted

Effect of Copy-On-Write on 2 processes sharing address space

The fork primitive makes a copy of the process. From within the processes, the parent and the child are almost identical; the few differences are the return value ...
Gilles 'SO- stop being evil''s user avatar
2 votes

Why sequential consistency model is widely used if it is unsound

The underlying hardware often has more relaxed memory ordering compared to SC. For example, the X86 will allow for older stores to be reordered with newer loads for a different address due to store ...
pveentjer's user avatar
  • 319
1 vote

Understanding IBM370 Relaxed Memory Consistency

Good question. So with TSO loads to a different address can't be reordered (in the global memory order) unless the earlier load can be satisfied by a store in the store buffer and the second load can'...
pveentjer's user avatar
  • 319
1 vote

Method of communication in Distributed Systems

Because in a distributed system, nodes do not have access to shared memory that is shared between all nodes. Shared memory is only typically feasible when the nodes are on a common memory bus, e.g., ...
D.W.'s user avatar
  • 161k
1 vote
Accepted

Usefulness of consensus number

You probably cannot do much better than quote the abstract of Herlihy's original paper: A wait-free implementation of a concurrent data object is one that guarantees that any process can complete ...
Yuval Filmus's user avatar
1 vote

Conway's Game Of Life Problem Parallel (OpenMP)

There is a simple solution. Instead of storing a hashmap of all positions, store the set of only the positions that are currently alive. Live cells are included in the set; dead cells are not. When ...
D.W.'s user avatar
  • 161k

Only top scored, non community-wiki answers of a minimum length are eligible