13904895
Descripción
Test por Good Guy Beket, actualizado hace más de 1 año
|
Creado por Good Guy Beket
hace más de 6 años
|
|
Pregunta 1
Pregunta
What is a Latency:
Respuesta
-
is time for a single access – Main memory latency is usually >> than processor cycle time
-
is the number of accesses per unit time – If m instructions are loads/stores, 1 + m memory accesses per instruction, CPI = 1 requires at least 1 + m memory accesses per cycle
-
is amount of data that can be in flight at the same time (Little’s Law)
Pregunta 2
Pregunta
What occurs at Intruction fetches when we speak about Common And Predictable Memory Reference Patterns?
Respuesta
-
n loop iterations
-
subroutine call
-
vector access
Pregunta 3
Pregunta
What occurs at Stack access when we speak about Common And Predictable Memory Reference Patterns?
Respuesta
-
subroutine call
-
n loop iterations
-
vector access
Pregunta 4
Pregunta
What occurs at Data access when we speak about Common And Predictable Memory Reference Patterns?
Respuesta
-
subroutine call
-
n loop iterations
-
vector access
Pregunta 5
Pregunta
Cache HIT:
Respuesta
-
No Write Allocate, Write Allocate
-
Write Through, Write Back
Pregunta 6
Pregunta
Cache MISS:
Respuesta
-
No Write Allocate, Write Allocate
-
Write Through, Write Back
Pregunta 7
Pregunta
Average Memory Access Time is equal:
Respuesta
-
Hit Time * ( Miss Rate + Miss Penalty )
-
Hit Time - ( Miss Rate + Miss Penalty )
-
Hit Time / ( Miss Rate - Miss Penalty )
-
Hit Time + ( Miss Rate * Miss Penalty )
Pregunta 8
Pregunta
The formula of “Iron Law” of Processor Performance:
Respuesta
-
time/program = instruction/program * cycles/instruction * time/cycle
-
time/program = instruction/program * cycles/instruction + time/cycle
-
time/program = instruction/program + cycles/instruction * time/cycle
Pregunta 9
Pregunta
Structural Hazard:
Respuesta
-
An instruction in the pipeline needs a resource being used by another instruction in the pipeline
-
An instruction depends on a data value produced by an earlier instruction
-
Whether or not an instruction should be executed depends on a control decision made by an earlier instruction
Pregunta 10
Pregunta
Data Hazard:
Respuesta
-
An instruction depends on a data value produced by an earlier instruction
-
An instruction in the pipeline needs a resource being used by another instruction in the pipeline
-
Whether or not an instruction should be executed depends on a control decision made by an earlier instruction
Pregunta 11
Pregunta
Control Hazard:
Respuesta
-
Whether or not an instruction should be executed depends on a control decision made by an earlier instruction
-
An instruction depends on a data value produced by an earlier instruction
-
An instruction in the pipeline needs a resource being used by another instruction in the pipeline
Pregunta 12
Pregunta
What is a Bandwidth:
Respuesta
-
a is the number of accesses per unit time – If m instructions are loads/stores, 1 + m memory accesses per instruction, CPI = 1 requires at least 1 + m memory accesses per cycle
-
is time for a single access – Main memory latency is usually >> than processor cycle time
-
is amount of data that can be in flight at the same time (Little’s Law)
Pregunta 13
Pregunta
What is a Bandwidth-Delay Product:
Respuesta
-
is amount of data that can be in flight at the same time (Little’s Law)
-
is time for a single access – Main memory latency is usually >> than processor cycle time
-
is the number of accesses per unit time – If m instructions are loads/stores, 1 + m memory accesses per instruction, CPI = 1 requires at least 1 + m memory accesses per cycle
Pregunta 14
Pregunta
What is Computer Architecture?
Respuesta
-
is the design of the abstraction/implementation layers that allow us to execute information processing applications efficiently using manufacturing technologies
-
is a group of computer systems and other computing hardware devices that are linked together through communication channels to facilitate communication and resource-sharing among a wide range of users
-
the programs used to direct the operation of a computer, as well as documentation giving instructions on how to use them
Pregunta 15
Pregunta
Least Recently Used (LRU):
Respuesta
-
cache state must be updated on every access
-
Used in highly associative caches
-
FIFO with exception for most recently used block(s)
Pregunta 16
Pregunta
Cache Hit -
Respuesta
-
Write Through – write both cache and memory, generally higher traffic but simpler to design
-
Write cache only, memory is written when evicted, dirty bit per block avoids unnecessary write backs, more complicated
-
No Write Allocate – only write to main memory
Pregunta 17
Pregunta
Reduce Miss Rate: Large Cache Size.
Empirical Rule of Thumb:
Respuesta
-
If cache size is doubled, miss rate usually drops by about √2
-
Direct-mapped cache of size N has about the same miss rate as a two-way set- associative cache of size N/2
-
None of them
Pregunta 18
Pregunta
Reduce Miss Rate: High Associativity.
Empirical Rule of Thumb:
Respuesta
-
Direct-mapped cache of size N has about the same miss rate as a two-way set- associative cache of size N/2
-
If cache size is doubled, miss rate usually drops by about √2
-
None of them
Pregunta 19
Pregunta
What is the access time?
Respuesta
-
Time between when a read is requested and when the desired word arrives
-
The minimum time between requests to memory.
-
Describes the technology inside the memory chips and those innovative, internal organizations
-
None of them
Pregunta 20
Pregunta
What is the cycle time?
Respuesta
-
The minimum time between requests to memory.
-
Time between when a read is requested and when the desired word arrives
-
The maximum time between requests to memory.
-
None of them
Pregunta 21
Pregunta
What does SRAM stands for?
Respuesta
-
Static Random Access memory
-
System Random Access memory
-
Short Random Access memory
-
None of them
Pregunta 22
Pregunta
What does DRAM stands for?
Respuesta
-
Dynamic Random Access memory
-
Dual Random Access memory
-
Dataram Random Access memory
Pregunta 23
Pregunta
Which one is concerning to fallacy?
Respuesta
-
Predicting cache performance of one program from another
-
Simulating enough instructions to get accurate performance measures of the memory hierarchy
-
Implementing a virtual machine monitor on an instruction set architecture that wasn’t designed to be virtualizable
-
Over emphasizing memory bandwidth in DRAMs
Pregunta 24
Pregunta
Which one is NOT concerning to pitfall?
Respuesta
-
Predicting cache performance of one program from another
-
Simulating enough instructions to get accurate performance measures of the memory hierarchy
-
Implementing a virtual machine monitor on an instruction set architecture that wasn’t designed to be virtualizable
-
Over emphasizing memory bandwidth in DRAMs
Pregunta 25
Pregunta
If we talk about storage systems an interaction or transaction with a computer is divided for first what is an “System response time” - ?
Respuesta
-
The time between when the user enters the command and the complete response is displayed
-
The time for the user to enter the command
-
The time from the reception of the response until the user begins to enter the next command
Pregunta 26
Pregunta
If we talk about storage systems an interaction or transaction with a computer is divided for first what is an “Think time” - ?
Respuesta
-
The time from the reception of the response until the user begins to enter the next command
-
The time for the user to enter the command
-
The time between when the user enters the command and the complete response is displayed
Pregunta 27
Pregunta
Little’s Law and a series of definitions lead to several useful equations for “Time server” -
Respuesta
-
Average time to service a task; average service rate is 1/Time server traditionally represented by the symbol µ in many queuing texts
-
Average time per task in the queue
-
Average time/task in the system, or the response time, which is the sum of Time queue and Time server
Pregunta 28
Pregunta
Little’s Law and a series of definitions lead to several useful equations for “Time queue” -
Respuesta
-
Average time per task in the queue
-
Average time to service a task; average service rate is 1/Time server traditionally represented by the symbol µ in many queuing texts
-
Average time/task in the system, or the response time, which is the sum of Time queue and Time server
Pregunta 29
Pregunta
Little’s Law and a series of definitions lead to several useful equations for “Time system” -
Respuesta
-
Average time/task in the system, or the response time, which is the sum of Time queue and Time server
-
Average time to service a task; average service rate is 1/Time server traditionally represented by the symbol µ in many queuing texts
-
Average time per task in the queue
Pregunta 30
Pregunta
Little’s Law and a series of definitions lead to several useful equations for “Length server” -
Respuesta
-
Average number of tasks in service
-
Average length of queue
Pregunta 31
Pregunta
Little’s Law and a series of definitions lead to several useful equations for “Length queue” -
Respuesta
-
Average length of queue
-
Average number of tasks in service
Pregunta 32
Pregunta
Select two-dimensional interconnection network
Respuesta
-
Mesh
-
Linear Array
-
Cross Bar
Pregunta 33
Pregunta
Select multi-dimensional interconnection network
Respuesta
-
Linear Array
-
Cross Bar
-
Cube
Pregunta 34
Pregunta
Select multi-dimensional interconnection network
Respuesta
-
Linear Array
-
Cross Bar
-
Hyper Cube
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.