Parallel Performance Modeling Flashcards

1
Q

What is parallel speedup?

A

Sp = T1 / Tp

The measure of performance improvement achieved by using multiple processors in parallel.

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

What is ideal speedup?

A

SIp = 1 / p

The theoretical maximum parallel speedup that could be achieved.

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

What is parallel efficiency?

A

Ep = Sp / p

Measure how far we are from the ideal speedup.

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

What is the serial fraction?

A

The fraction of the program cannot be parallelized.

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

What is Brent’s Theorem?

A

Tp <= t + (m-t) / p

m = number of tasks
t = critical path
p = number of processors

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

What is PRAM Model?

A

Parallel Random Access Machine: Every memory location is accessible to any processor.

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

What is an EREW PRAM model?

A

Exclusive read, exclusive write PRAM.

Only one processor at a time can read or write.

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

Limitations of the PRAM model?

A

Unrealistic and Perform poorly.

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

What is Bulk Synchronous Parallel Model?

A

Orders the program into a sequence of supersteps, each ending with a barrier synchronization.

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

What are the 3 components of a super-step in the BSP model?

A

Local Computation
Global Communication
Barrier Synchronization

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

How is the execution time of a super-step in the BSP model calculated?

A

tStep = max(wi) + mg * max(hi) + l

Wi = time for local work on processor i
Hi = number of incoming or outgoing messages for processor i
M = message size
G = BSP bandwidth parameter.
L = BSP latency parameter.

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

What is an h-relation

A

A communication pattern whose properties are summarized by the parameter h.

h is the larger number of incoming or outgoing interactions in a communication step.

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

How is the execution time of a super-step in the BSP model calculated?

A

tStep = max(wi) + mg * max(hi) + l

Wi = time for local work on processor i
Hi = number of incoming or outgoing messages for processor i
M = message size
G = BSP bandwidth parameter.
L = BSP latency parameter.

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

What 3 architectural parameters are used to describe the BSP model?

A

P = number of processors,
G = bandwidth parameter
L = barrier synchronization latency

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

What is super-linear speedup?

A

When the speedup is larger than the number of processors

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

What is parallel overhead?

A

The time to coordinate and manage the program on multiple processors in parallel.

The time difference between experimental and ideal speedup.

17
Q

What are the reasons that superlinear speedup is sometimes observed?

A

Net cache increases with more processors, thus decreasing cache miss rate which is responsible for a superlinear speedup.