Deck 14: Parallel Computing and GPU Architecture
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 14: Parallel Computing and GPU Architecture
1
If there is 4X4 Mesh Topology ______ message passing cycles will require complete all to all reduction.
A)4
B)6
C)8
D)16
A)4
B)6
C)8
D)16
8
2
Following issue(s) is/are the true about sorting techniques with parallel computing.
A)large sequence is the issue
B)where to store output sequence is the issue
C)small sequence is the issue
D)none of the above
A)large sequence is the issue
B)where to store output sequence is the issue
C)small sequence is the issue
D)none of the above
where to store output sequence is the issue
3
Partitioning on series done after ______________
A)local arrangement
B)processess assignments
C)global arrangement
D)none of the above
A)local arrangement
B)processess assignments
C)global arrangement
D)none of the above
global arrangement
4
In Parallel DFS processes has following roles.(Select multiple choices if applicable)
A)donor
B)active
C)idle
D)passive
A)donor
B)active
C)idle
D)passive
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
5
Suppose there are 16 elements in a series then how many phases will be required to sort the series using parallel odd-even bubble sort?
A)8
B)4
C)5
D)15
A)8
B)4
C)5
D)15
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
6
Which are different sources of Overheads in Parallel Programs?
A)interprocess interactions
B)process idling
C)all mentioned options
D)excess computation
A)interprocess interactions
B)process idling
C)all mentioned options
D)excess computation
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
7
The ratio of the time taken to solve a problem on a parallel processors to the time required to solve the same problem on a single processor with p identical processing elements.
A)the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements.
B)the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements
C)the ratio of number of multiple processors to size of data
D)none of the above
A)the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements.
B)the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements
C)the ratio of number of multiple processors to size of data
D)none of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
8
CUDA helps do execute code in parallel mode using __________
A)cpu
B)gpu
C)rom
D)cash memory
A)cpu
B)gpu
C)rom
D)cash memory
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
9
In thread-function execution scenario thread is a ___________
A)work
B)worker
C)task
D)none of the above
A)work
B)worker
C)task
D)none of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
10
In GPU Following statements are true
A)grid contains block
B)block contains threads
C)all the mentioned options.
D)sm stands for streaming multiprocessor
A)grid contains block
B)block contains threads
C)all the mentioned options.
D)sm stands for streaming multiprocessor
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
11
Computer system of a parallel computer is capable of_____________
A)decentralized computing
B)parallel computing
C)centralized computing
D)all of these
A)decentralized computing
B)parallel computing
C)centralized computing
D)all of these
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
12
In which application system Distributed systems can run well?
A)hpc
B)distrubuted framework
C)hrc
D)none of the above
A)hpc
B)distrubuted framework
C)hrc
D)none of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
13
A pipeline is like .................... ?
A)an automobile assembly line
B)house pipeline
C)both a and b
D)a gas line
A)an automobile assembly line
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
14
Pipeline implements ?
A)fetch instruction
B)decode instruction
C)fetch operand
D)all of above
A)fetch instruction
B)decode instruction
C)fetch operand
D)all of above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
15
A processor performing fetch or decoding of different instruction during the execution of another instruction is called ______ ?
A)super-scaling
B)pipe-lining
C)parallel computation
D)none of these
A)super-scaling
B)pipe-lining
C)parallel computation
D)none of these
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
16
VLIW stands for ?
A)very long instruction word
B)very long instruction width
C)very large instruction word.
D)very long instruction width.
A)very long instruction word
B)very long instruction width
C)very large instruction word.
D)very long instruction width.
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
17
Which one is not a limitation of a distributed memory parallel system?
A)higher communication time
B)cache coherency
C)synchronization overheads
D)none of the above
A)higher communication time
B)cache coherency
C)synchronization overheads
D)none of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
18
Which of these steps can create conflict among the processors?
A)synchronized computation of local variables
B)concurrent write
C)concurrent read
D)none of the above
A)synchronized computation of local variables
B)concurrent write
C)concurrent read
D)none of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
19
Which one is not a characteristic of NUMA multiprocessors?
A)it allows shared memory computing
B)memory units are placed in physically different location
C)all memory units are mapped to one common virtual global memory
D)processors access their independent local memories
A)it allows shared memory computing
B)memory units are placed in physically different location
C)all memory units are mapped to one common virtual global memory
D)processors access their independent local memories
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
20
Which of these is not a source of overhead in parallel computing?
A)non-uniform load distribution
B)less local memory requirement in distributed computing
C)synchronization among threads in shared memory computing
D)none of the above
A)non-uniform load distribution
B)less local memory requirement in distributed computing
C)synchronization among threads in shared memory computing
D)none of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
21
Systems that do not have parallel processing capabilities are?
A)sisd
B)simd
C)mimd
D)all of the above
A)sisd
B)simd
C)mimd
D)all of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
22
How does the number of transistors per chip increase according to Moore ´s law?
A)quadratically
B)linearly
C)cubicly
D)exponentially
A)quadratically
B)linearly
C)cubicly
D)exponentially
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
23
Parallel processing may occur?
A)in the instruction stream
B)in the data stream
C)both[a] and [b]
D)none of the above
A)in the instruction stream
B)in the data stream
C)both[a] and [b]
D)none of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
24
To which class of systems does the von Neumann computer belong?
A)simd (single instruction multiple data)
B)mimd (multiple instruction multiple data)
C)misd (multiple instruction single data)
D)sisd (single instruction single data)
A)simd (single instruction multiple data)
B)mimd (multiple instruction multiple data)
C)misd (multiple instruction single data)
D)sisd (single instruction single data)
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
25
Fine-grain threading is considered as a ______ threading?
A)instruction-level
B)loop level
C)task-level
D)function-level
A)instruction-level
B)loop level
C)task-level
D)function-level
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck