13904895
Beschreibung
Quiz von Good Guy Beket, aktualisiert more than 1 year ago
|
Erstellt von Good Guy Beket
vor mehr als 6 Jahre
|
|
Frage 1
Frage
What is a Latency:
Antworten
-
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)
Frage 2
Frage
What occurs at Intruction fetches when we speak about Common And Predictable Memory Reference Patterns?
Antworten
-
n loop iterations
-
subroutine call
-
vector access
Frage 3
Frage
What occurs at Stack access when we speak about Common And Predictable Memory Reference Patterns?
Antworten
-
subroutine call
-
n loop iterations
-
vector access
Frage 4
Frage
What occurs at Data access when we speak about Common And Predictable Memory Reference Patterns?
Antworten
-
subroutine call
-
n loop iterations
-
vector access
Frage 5
Frage
Cache HIT:
Antworten
-
No Write Allocate, Write Allocate
-
Write Through, Write Back
Frage 6
Frage
Cache MISS:
Antworten
-
No Write Allocate, Write Allocate
-
Write Through, Write Back
Frage 7
Frage
Average Memory Access Time is equal:
Antworten
-
Hit Time * ( Miss Rate + Miss Penalty )
-
Hit Time - ( Miss Rate + Miss Penalty )
-
Hit Time / ( Miss Rate - Miss Penalty )
-
Hit Time + ( Miss Rate * Miss Penalty )
Frage 8
Frage
The formula of “Iron Law” of Processor Performance:
Antworten
-
time/program = instruction/program * cycles/instruction * time/cycle
-
time/program = instruction/program * cycles/instruction + time/cycle
-
time/program = instruction/program + cycles/instruction * time/cycle
Frage 9
Frage
Structural Hazard:
Antworten
-
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
Frage 10
Frage
Data Hazard:
Antworten
-
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
Frage 11
Frage
Control Hazard:
Antworten
-
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
Frage 12
Frage
What is a Bandwidth:
Antworten
-
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)
Frage 13
Frage
What is a Bandwidth-Delay Product:
Antworten
-
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
Frage 14
Frage
What is Computer Architecture?
Antworten
-
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
Frage 15
Frage
Least Recently Used (LRU):
Antworten
-
cache state must be updated on every access
-
Used in highly associative caches
-
FIFO with exception for most recently used block(s)
Frage 16
Frage
Cache Hit -
Antworten
-
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
Frage 17
Frage
Reduce Miss Rate: Large Cache Size.
Empirical Rule of Thumb:
Antworten
-
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
Frage 18
Frage
Reduce Miss Rate: High Associativity.
Empirical Rule of Thumb:
Antworten
-
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
Frage 19
Frage
What is the access time?
Antworten
-
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
Frage 20
Frage
What is the cycle time?
Antworten
-
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
Frage 21
Frage
What does SRAM stands for?
Antworten
-
Static Random Access memory
-
System Random Access memory
-
Short Random Access memory
-
None of them
Frage 22
Frage
What does DRAM stands for?
Antworten
-
Dynamic Random Access memory
-
Dual Random Access memory
-
Dataram Random Access memory
Frage 23
Frage
Which one is concerning to fallacy?
Antworten
-
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
Frage 24
Frage
Which one is NOT concerning to pitfall?
Antworten
-
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
Frage 25
Frage
If we talk about storage systems an interaction or transaction with a computer is divided for first what is an “System response time” - ?
Antworten
-
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
Frage 26
Frage
If we talk about storage systems an interaction or transaction with a computer is divided for first what is an “Think time” - ?
Antworten
-
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
Frage 27
Frage
Little’s Law and a series of definitions lead to several useful equations for “Time server” -
Antworten
-
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
Frage 28
Frage
Little’s Law and a series of definitions lead to several useful equations for “Time queue” -
Antworten
-
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
Frage 29
Frage
Little’s Law and a series of definitions lead to several useful equations for “Time system” -
Antworten
-
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
Frage 30
Frage
Little’s Law and a series of definitions lead to several useful equations for “Length server” -
Antworten
-
Average number of tasks in service
-
Average length of queue
Frage 31
Frage
Little’s Law and a series of definitions lead to several useful equations for “Length queue” -
Antworten
-
Average length of queue
-
Average number of tasks in service
Frage 32
Frage
Select two-dimensional interconnection network
Antworten
-
Mesh
-
Linear Array
-
Cross Bar
Frage 33
Frage
Select multi-dimensional interconnection network
Antworten
-
Linear Array
-
Cross Bar
-
Cube
Frage 34
Frage
Select multi-dimensional interconnection network
Antworten
-
Linear Array
-
Cross Bar
-
Hyper Cube
Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.