Lesson 4a Flashcards

Parallel Systems

1
Q

What is dance hall arch

A

CPUS on one side of integrated network. Memory on the other side

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

What is smp

A

symmetric multiprocessor. All cpus share the same memory

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

In dance ahll and smp how many caches exist

A

Once Cache per cpu

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

what is DSm

A

Distributed shared memory

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

How is smp different from dsm

A

Each cpu has its own memory in dsm. in smp we have a single memory

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

How many network connections (dance hall?)

A

One all cpus are connected to it

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

What is the process for getting memory using smp

A

each cpu checks its local cache before going to the system bus and then main memory

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

what is cache coherence problem

A

when a value y is cached across all cpu caches and one cpu updates the value. How are the other caches invalidated and updated?

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

What is the memory consistency model

A

A contract between the software and hardware that specifies how the data stay consistent across caches and also when multiple processors are accessing the same memory locations

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

What is the sequential consistency model (SC)

A

Program order arbitrary interleaving (think of card shuffle) (Lessly Lamport)

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

Program Order?

A

Memory instructions are performed in the order written. Linearly executed one after the other.

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

Arbitrary Interleaving

A

When P1 and P2 access memory it is arbitrary

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

what question does memory consistency answer?

A

What is the model presented to the programmer

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

What question does cache coherence answer

A

How is the system implementing the model in the presence of private caches?

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

What is NCC

A

Non-cache coherence has shared memory and private caches but when memory is changed it is a software problem to keep it in sync

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

What is CC processor

A

Cache Coherent. It is enforced (insured) by the hardware

17
Q

Hardware CC what happens when a value is updated?

A

An “invalidate” message is sent on the bus and the other cpu caches are cleared (invalidated) of this entry.

18
Q

What is a write update in hardware CC?

A

Instead of invalidating the cache, each cache is updated with the new value (“if they have an entry”)

19
Q

What are the scalability pros and cons of SMP

A

Pro: Parallelism increases processing power
Con: Increased overhead due to CC

20
Q

Is the performance increase linear with the number of processors introduced

A

No, it is the “actual”performance which is between the expected performance and the introduced overhead

21
Q

When do shared memory machines scale well?

A

“When you don’t share memory”