Question 31 :
The___ time collectively spent by all the processing elements Tall = p TP
- total
- sum
- average
- product
Question 32 :
Wating until there is no data hazards then
- stall
- write operand
- Read operand
- Branching
Question 33 :
This is computation not performed by the serial version
- Serial computation
- Excess computation
- serial computation
- parallel computing
Question 34 :
Interprocess communication that take place
- Centralized memory
- Message passing
- shared memory
- cache memory
Question 35 :
if a piece of data is repeatedly used, the effective latency of this memory system can be reduced by the __________.
- RAM
- ROM
- Cache
- HDD
Question 36 :
Any condition that causes a processor to stall is called as _________
- page fault
- system error
- Hazard
- execuation error
Question 37 :
The important feature of the VLIW is ______
- ILP
- Performance
- Cost effectiveness
- delay
Question 38 :
MPI_Comm_rank
- returns rank
- returns processes
- returns value
- Returns value of instruction
Question 39 :
MPI_Finalize used for
- Stop mpi environment program
- intitalise program
- Include header files
- program start
Question 40 :
The expression 'delayed load' is used in context of
- prefetching
- pipelining
- processor-printer communication
- memory-monitor communication
Question 41 :
The pattern of___________ among tasks is captured by what is known as a task-interaction graph
- interaction
- communication
- optmization
- flow
Question 42 :
The tightly coupled set of threads execution working on a single task ,that is called
- Multithreading
- Parallel processing
- Recurrence
- Serial processing
Question 43 :
A processor performing fetch or decoding of different instruction during the execution of another instruction is called ______ .
- Super-scaling
- Pipe-lining
- Parallel Computation
- distributed
Question 44 :
Which MIMD systems are best scalable with respect to the number of processors
- Distributed memory
- ccNUMA
- nccNUMA
- Symmetric multiprocessor
Question 45 :
NSM has launched its first supercomputer at
- BHU
- IITB
- IITKG
- IITM
Question 46 :
A type of parallelism that uses micro architectural techniques.
- bit based
- bit level
- increasing
- instructional
Question 47 :
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
Question 48 :
A multiprocessor operating system must take care of
- authorized data access and data protection
- unauthorized data access and data protection
- authorized data access
- data protection
Question 49 :
Speed up is defined as a ratio of
- s=Ts/Tp
- S= Tp/Ts
- Ts=S/Tp
- Tp=S /Ts
Question 50 :
Scheduling of instructions is determined_
- True Data Dependency
- Resource Dependency
- Branch Dependency
- All of above
Question 51 :
Switches map a fixed number of inputs to outputs.
- TRUE
- FALSE
Question 52 :
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
Question 53 :
If no node having a copy of a cache block, this technique is known as
- Uniform memory access
- Cached
- Un-cached
- Commit
Question 54 :
Characteristic of RISC (Reduced Instruction Set Computer) instruction set is
- one word instruction
- two word instruction
- three word instruction
- four word instruction
Question 55 :
The interconnection topologies are implemented using _________ as a node.
- control unit
- microprocessor
- processing unit
- microprocessor or processing unit
Question 56 :
In a distributed computing environment, distributed shared memory is used which is_____________
- Logical combination of virtual memories on the nodes
- Logical combination of physical memories on the nodes
- Logical combination of the secondary memories on all the nodes
- Logical combinatin of files
Question 57 :
Data parallelism is parallelism inherent in
- program loops
- Serial program
- parallel program
- long programs
Question 58 :
High performance computing of the computer system tasks are done by
- node clusters
- network clusters
- Beowulf clusters
- compute nodes
Question 59 :
Content of the program counter is added to the address part of the instruction in order to obtain the effective address is called
- relative address mode
- index addressing mode
- register mode
- implied mode
Question 60 :
Divide and Conqure apporach is known for
- Sequentional algorithm development
- parallel algorithm develpoment
- Task defined algorithm
- Non defined Algorithm