Distributed Shared Memory Flashcards

1
Q

What is Distributed Shared Memory?

A

Each computer owns some portion of shared memory. Anyone can read/write from any other node, but the details have been abstracted away, so it appears as though you are r/w-ing from your own computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the pros/cons for DSM?

A

Slower memory access

Allows for larger physical memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the levels of granularity for sending changes in DSM? Why did we choose these?

A

pages or objects.

They are large enough to justify sending changes across the network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is false sharing?

A

When two process write to different locations in the same page and trigger consistency mechanisms that are unnecessary and impede performance

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is migration in DSM?

A

When you copy remote memory to your local machine. This is okay for SRSW, but has a high overhead and is slow

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is replication in DSM?

A

(Some) state is store across multiple nodes (that need it). Uses caching to speed up performance, but requires synchronization mechanisms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are the consistency options in DSM?

A

Eager (push invalidations whenever there is a write) and lazy (push changes periodically)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe the architecture of DSM? What is a home node and how does it help manage the DSM? What is an owner node?

A

Each node contributes some part of their MM to the DSM. Each address is references by (node ID, local page frame).

A home node is the node where a page frame is physically located. It manages coherence (locking, accesses, etc) for that frame. Other nodes may cache that page frame to improve performance.

The owner node is the node with the current write lock on a page frame

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How does a node determine where a page is located in DSM?

A

Nodes can use the address to determine the home node it. Each home node has appropriate metadata for that page.

This is a combination of a replicated + partitioned system.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How does a node’s hardware help with memory accesses in DSM?

A

When fetching an address, the MMU will trap if it cannot find the address. Control returns to OS, who can then retrieve the memory from the DSM network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is a consistency model?

A

A guarantee that memory will behave correctly, as long as the upper level software follows a list of rules

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is strict consistency?

A

Updates are visible everywhere immediately ==> not possible even on SMP without locking, etc

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is sequential consistency?

A

Memory updates from different processors may be arbitrarily interleaved, if they don’t affect each other. All ops from same processor must be in correct order and all processors must see the same interleaving.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is causal consistency?

A

Model will detect potential causal consistency and preserve ordering

  • if p1 writes to X, then p2 reads X and writes to Y
  • Potential that the value of X is related to the new value of Y
  • model will ensure that everyone sees updates to X before Y
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is weak consistency?

A

Tries to cut down on overhead from causal consistency. Synchronization points guarantee that all updates that were available before that point will be visible to everyone. Each processor must call sync.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly