On This Page
This set of High Performance Computing HPC Multiple Choice Questions & Answers (MCQs) focuses on High Performance Computing Set 15
Q1 | Multiprocessor is systems with multiple CPUs, which are capable of independently executing different tasks in parallel. In this category every processor and memory module has similar access time?
- uma
- microprocessor
- multiprocessor
- numa
Q2 | For inter processor communication the miss arises are called?
- hit rate
- coherence misses
- comitt misses
- parallel processing
Q3 | NUMA architecture uses _______in design?
- cache
- shared memory
- message passing
- distributed memory
Q4 | A multiprocessor machine which is capable of executing multiple instructions on multiple data sets?
- sisd
- simd
- mimd
- misd
Q5 | In message passing, send and receive message between?
- task or processes
- task and execution
- processor and instruction
- instruction and decode
Q6 | The First step in developing a parallel algorithm is_________?
- to decompose the problem into tasks that can be executed concurrently
- execute directly
- execute indirectly
- none of above
Q7 | The number of tasks into which a problem is decomposed determines its?
- granularity
- priority
- modernity
- none of above
Q8 | The length of the longest path in a task dependency graph is called?
- the critical path length
- the critical data length
- the critical bit length
- none of above
Q9 | The graph of tasks (nodes) and their interactions/data exchange (edges)?
- is referred to as a task interaction graph
- is referred to as a task communication graph
- is referred to as a task interface graph
- none of above
Q10 | Mappings are determined by?
- task dependency
- task interaction graphs
- both a and b
- none of above
Q11 | Decomposition Techniques are?
- recursive decomposition
- data decomposition
- exploratory decomposition
- all of above
Q12 | The Owner Computes Rule generally states that the process assigned a particular data item is responsible for?
- all computation associated with it
- only one computation
- only two computation
- only occasionally computation
Q13 | A simple application of exploratory decomposition is_?
- the solution to a 15 puzzle
- the solution to 20 puzzle
- the solution to any puzzle
- none of above
Q14 | Speculative Decomposition consist of _?
- conservative approaches
- optimistic approaches
- both a and b
- only b
Q15 | task characteristics include?
- task generation.
- task sizes.
- size of data associated with tasks.
- all of above
Q16 | Writing parallel programs is referred to as?
- parallel computation
- parallel processes
- parallel development
- parallel programming
Q17 | Parallel Algorithm Models?
- data parallel model
- bit model
- data model
- network model
Q18 | The number and size of tasks into which a problem is decomposed determines the?
- fine-granularity
- coarse-granularity
- sub task
- granularity
Q19 | A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?
- critical
- easy
- difficult
- ambiguous
Q20 | The pattern of___________ among tasks is captured by what is known as a task-interaction graph?
- interaction
- communication
- optmization
- flow
Q21 | Interaction overheads can be minimized by____?
- maximize data locality
- maximize volume of data exchange
- increase bandwidth
- minimize social media contents
Q22 | Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?
- task
- instruction
- data
- program
Q23 | Speed up is defined as a ratio of?
- s=ts/tp
- s= tp/ts
- ts=s/tp
- tp=s /ts
Q24 | Parallel computing means to divide the job into several __________?
- bit
- data
- instruction
- task
Q25 | _________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy?
- exploratory decomposition
- speculative decomposition
- data-decomposition
- recursive decomposition