Deck 16: Parallel Processing and Algorithms
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/25
Play
Full screen (f)
Deck 16: Parallel Processing and Algorithms
1
The___ time collectively spent by all the processing elements Tall = p TP?
A)total
B)average
C)mean
D)sum
A)total
B)average
C)mean
D)sum
total
2
The dual of one-to-all broadcast is ?
A)all-to-one reduction
B)all-to-one receiver
C)all-to-one sum
D)none of above
A)all-to-one reduction
B)all-to-one receiver
C)all-to-one sum
D)none of above
all-to-one reduction
3
A hypercube has?
A)2d nodes
B)2d nodes.
C)2n nodes
D)n nodes
A)2d nodes
B)2d nodes.
C)2n nodes
D)n nodes
2d nodes
4
The Prefix Sum Operation can be implemented using the ?
A)all-to-all broadcast kernel.
B)all-to-one broadcast kernel.
C)one-to-all broadcast kernel
D)scatter kernel
A)all-to-all broadcast kernel.
B)all-to-one broadcast kernel.
C)one-to-all broadcast kernel
D)scatter kernel
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
5
In the scatter operation ?
A)single node send a unique message of size m to every other node
B)single node send a same message of size m to every other node
C)single node send a unique message of size m to next node
D)none of above
A)single node send a unique message of size m to every other node
B)single node send a same message of size m to every other node
C)single node send a unique message of size m to next node
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
6
The gather operation is exactly the inverse of the ?
A)scatter operation
B)broadcast operation
C)prefix sum
D)reduction operation
A)scatter operation
B)broadcast operation
C)prefix sum
D)reduction operation
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
7
Parallel algorithms often require a single process to send identical data to all other processes or to a subset of them. This operation is known as _________?
A)one-to-all broadcast
B)all to one broadcast
C)one-to-all reduction
D)all to one reduction
A)one-to-all broadcast
B)all to one broadcast
C)one-to-all reduction
D)all to one reduction
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
8
In which of the following operation, a single node sends a unique message of size m to every other node?
A)gather
B)scatter
C)one to all personalized communication
D)both a and c
A)gather
B)scatter
C)one to all personalized communication
D)both a and c
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
9
Gather operation is also known as ________?
A)one to all personalized communication
B)one to all broadcast
C)all to one reduction
D)all to all broadcast
A)one to all personalized communication
B)one to all broadcast
C)all to one reduction
D)all to all broadcast
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
10
Conventional architectures coarsely comprise of a?
A)a processor
B)memory system
C)data path.
D)all of above
A)a processor
B)memory system
C)data path.
D)all of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
11
Data intensive applications utilize?
A)high aggregate throughput
B)high aggregate network bandwidth
C)high processing and memory system performance.
D)none of above
A)high aggregate throughput
B)high aggregate network bandwidth
C)high processing and memory system performance.
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
12
A pipeline is like?
A)overlaps various stages of instruction execution to achieve performance.
B)house pipeline
C)both a and b
D)a gas line
A)overlaps various stages of instruction execution to achieve performance.
B)house pipeline
C)both a and b
D)a gas line
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
13
Scheduling of instructions is determined?
A)Data dependency
B)resource dependency
C)branch dependency
D)all of above
A)Data dependency
B)resource dependency
C)branch dependency
D)all of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
14
VLIW processors rely on?
A)compile time analysis
B)initial time analysis
C)final time analysis
D)mid time analysis
A)compile time analysis
B)initial time analysis
C)final time analysis
D)mid time analysis
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
15
Memory system performance is largely captured by?
A)latency
B)bandwidth
C)both a and b
D)none of above
A)latency
B)bandwidth
C)both a and b
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
16
The fraction of data references satisfied by the cache is called?
A)cache hit ratio
B)cache fit ratio
C)cache best ratio
D)none of above
A)cache hit ratio
B)cache fit ratio
C)cache best ratio
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
17
A single control unit that dispatches the same Instruction to various processors is?
A)simd
B)spmd
C)mimd
D)none of above
A)simd
B)spmd
C)mimd
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
18
The primary forms of data exchange between parallel tasks are?
A)accessing a shared data space
B)exchanging messages.
C)both a and b
D)none of above
A)accessing a shared data space
B)exchanging messages.
C)both a and b
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
19
The First step in developing a parallel algorithm is?
A)to decompose the problem into tasks that can be executed concurrently
B)execute directly
C)execute indirectly
D)none of above
A)to decompose the problem into tasks that can be executed concurrently
B)execute directly
C)execute indirectly
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
20
The Owner Computes Rule generally states that the process assigned a particular data item are responsible for?
A)all computation associated with it
B)only one computation
C)only two computation
D)only occasionally computation
A)all computation associated with it
B)only one computation
C)only two computation
D)only occasionally computation
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
21
A simple application of exploratory decomposition is?
A)the solution to a 15 puzzle
B)the solution to 20 puzzle
C)the solution to any puzzle
D)none of above
A)the solution to a 15 puzzle
B)the solution to 20 puzzle
C)the solution to any puzzle
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
22
Speculative Decomposition consist of ?
A)conservative approaches
B)optimistic approaches
C)both a and b
D)only b
A)conservative approaches
B)optimistic approaches
C)both a and b
D)only b
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
23
Task characteristics include?
A)task generation.
B)task sizes.
C)size of data associated with tasks.
D)all of above.
A)task generation.
B)task sizes.
C)size of data associated with tasks.
D)all of above.
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
24
The dual of one-to-all broadcast is?
A)all-to-one reduction
B)all-to-one receiver
C)all-to-one sum
D)none of above
A)all-to-one reduction
B)all-to-one receiver
C)all-to-one sum
D)none of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
25
A hypercube has?
A)2d nodes
B)3d nodes
C)2n nodes
D)n nodes
A)2d nodes
B)3d nodes
C)2n nodes
D)n nodes
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck