Question
a.
Buffer-grained multithreading
b.
Control dependences
c.
Strip cutting
d.
Strip mining
Posted under Pipeline and Vector Processing Computer Architecture
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. When the vector gets longer than the max length of its, then a technique called
Similar Questions
Discover Related MCQs
Q. The horizontal and diagonal roofs when meeting offers, insight into the computer is known as
View solution
Q. The on-chip memory which is local to every multithreaded Single Instruction Multiple Data (SIMD) Processor is called
View solution
Q. A processor, assigned with a thread block, that executes a code, which we usually call a
View solution
Q. A code, known as Grid, which runs on a GPU consisting of a set of
View solution
Q. The machine object created by the hardware, managing, scheduling, and executing is a thread of
View solution
Q. Level of detail getting dropping down, the PTX assembler sets a marker naming as
View solution
Q. The physical characteristics of the die named as GTX 48 are impressively large: the size of the die is
View solution
Q. To be gathered in a single register, the distance separating elements are called
View solution
Q. Every dependence analysis algorithms working on the supposition that array indices are
View solution
Q. The instruction d = 0 - a; is the type of
View solution
Q. NVIDIA thought that 'unifying theme' of every forms of parallelism is the
View solution
Q. The aggregate register file has a size of
View solution
Q. Each bank register of fixed-length maintaining a single vector, is referred to as
View solution
Q. Threads being blocked altogether and being executed in the sets of 32 threads, called a
View solution
Q. A register which can easily contain programs which naturally have very shorter vectors instead of the max size a computer architecture can support, is known as
View solution
Q. An obvious and sufficient test for the dependence's absence is the
View solution
Q. Pipeline having stalls are required only single time per vector instruction, instead of once per
View solution
Q. The memory bandwidth of the GPU is,
View solution
Q. The two iteration indices, j and k, and these both are in the limits of the FOR loop, for-loop index variable which runs from m to n i.e
View solution
Q. Cache benefits including Ray casting (RC) is only
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Computer Architecture? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
