com 1
Quiz yourself by thinking what should be in
each of the black spaces below before clicking
on it to display the answer.
Help!
|
|
||||
---|---|---|---|---|---|
show | John von Neumannat (the Institute for Advanced Studies, Princeton.)
🗑
|
||||
show | software.
🗑
|
||||
The processing required for a single instruction is called a(n) | show 🗑
|
||||
show | hardware failure
🗑
|
||||
a ___generated by some condition that occurs as a result of an instruction execution. | show 🗑
|
||||
A bus that connects major computer components (processor, memory, I/O) is called a | show 🗑
|
||||
___ are used to designate the source or destination of the data on the data bus. | show 🗑
|
||||
The data lines provide a path for moving data among system modules and are collectively called the | show 🗑
|
||||
A ___ is the high-level set of rules for exchanging packets of data between devices. | show 🗑
|
||||
show | lane
🗑
|
||||
___receives read and write requests from the software above the TL and creates request packets for transmission to a destination via the link layer. | show 🗑
|
||||
show | The QPI routing layer
🗑
|
||||
A ___ specifies the address in memory for the next read or write. | show 🗑
|
||||
A ___ contains the data to be written into memory or receives the data read from memory. | show 🗑
|
||||
The most common classes of interrupts are: program, timer, I/O and | show 🗑
|
||||
A(n) ___ is generated by a timer within the processor and allows the operating system to perform certain functions on a regular basis. | show 🗑
|
||||
A(n) ___ is generated by an I/O controller to signal normal completion of an operation, request service from the processor, or to signal a variety of error conditions. | show 🗑
|
||||
show | disabled interrupt
🗑
|
||||
show | interconnection structure.
🗑
|
||||
A ___ is a communication pathway connecting two or more devices. | show 🗑
|
||||
The ___ lines are used to control the access to and the use of the data and address lines. | show 🗑
|
||||
show | power management packets
🗑
|
||||
The purpose of the PCIe ___ layer is to ensure reliable delivery of packets across the PCIe link. | show 🗑
|
||||
show | balanced
🗑
|
||||
The QPI link layer performs two key functions: flow control and | show 🗑
|
||||
___is a popular high-bandwidth, processor-independent bus that can function as a mezzanine or peripheral bus. | show 🗑
|
||||
show | flow control
🗑
|
||||
show | Locality of reference
🗑
|
||||
One assertion that locality is based on is that as a function of time, the probability that a given unit of memory is referenced tends to change... | show 🗑
|
||||
___ location reflects the tendency of a program to access data locations sequentially, such as when processing a table of data. | show 🗑
|
||||
show | temporal
🗑
|
||||
show | Spatial
🗑
|
||||
show | instruction temporal locality
🗑
|
||||
show | data temporal locality
🗑
|
||||
show | location
🗑
|
||||
show | External
🗑
|
||||
show | Unit of transfer
🗑
|
||||
show | Sequential access
🗑
|
||||
___ is a random access type of memory that enables one to make a comparison of desired bit locations within a word for a specified match, and to do this for all words simultaneously. | show 🗑
|
||||
show | Access time (latency)
🗑
|
||||
show | Main
🗑
|
||||
show | Coherence
🗑
|
||||
show | processor
🗑
|
||||
The principle of ___ reflects the observation that during the course of execution of a program memory references by the processor tend to cluster. | show 🗑
|
||||
Two forms of locality are temporal locality and | show 🗑
|
||||
___ locality refers to the tendency of a program to reference in the near future those units of memory referenced in the recent past. | show 🗑
|
||||
show | Spatial
🗑
|
||||
___instruction is an instruction that exists in the code to be executed. | show 🗑
|
||||
___ instruction is instructions that appear in the execution trace of a program. | show 🗑
|
||||
From a user's point of view, the two most important characteristics of memory are capacity and | show 🗑
|
||||
show | Transfer rate
🗑
|
||||
show | Memory cycle time
🗑
|
||||
External, ___ is referred to as secondary memory or auxiliary memory. | show 🗑
|
||||
show | Coherence
🗑
|
||||
show | Locality
🗑
|
||||
show | Access time
🗑
|
||||
show | Inclusion
🗑
|
||||
The ___ cache is slower and typically larger than the L2 cache. | show 🗑
|
||||
___ is the minimum unit of transfer between cache and main memory. | show 🗑
|
||||
To distinguish between the data transferred and the chunk of physical memory, the term ___ , is sometimes used with reference to caches. | show 🗑
|
||||
___ is a portion of a cache line that is used for addressing purposes. | show 🗑
|
||||
show | Direct mapping
🗑
|
||||
show | thrashing.
🗑
|
||||
The principal disadvantage of ___ mapping is the complex circuitry required to examine the tags of all cache lines in parallel. | show 🗑
|
||||
show | least recently used (LRU)
🗑
|
||||
show | first-in-first-out (FIFO)
🗑
|
||||
show | first-in-first-out (FIFO)
🗑
|
||||
The ___ dictates that a piece of data in one cache is guaranteed to be also found in all lower levels of caches. | show 🗑
|
||||
show | exclusive policy
🗑
|
||||
show | Fetch/decode unit
🗑
|
||||
show | Execution units
🗑
|
||||
With ___ additional hardware is used to ensure that all updates to main memory via cache are reflected in all caches. | show 🗑
|
||||
___memory is designed to combine the memory access time of expensive, high-speed memory combined with the large memory size of less expensive, lower-speed memory. | show 🗑
|
||||
show | Locality of reference
🗑
|
||||
show | line size
🗑
|
||||
___ computing deals with supercomputers and their software, especially for scientific applications that involve large amounts of data, vector and matrix computation, and the use of parallel algorithms. | show 🗑
|
||||
show | physical
🗑
|
||||
Three mapping techniques that are used for logically organizing cache are direct, ___ , and set-associative. | show 🗑
|
||||
show | Content-addressable memory (CAM)
🗑
|
||||
___ mapping is a compromise that exhibits the strengths of both the direct and associative approaches while reducing their disadvantages. | show 🗑
|
||||
show | Set
🗑
|
||||
show | least frequently used (LFU)
🗑
|
||||
show | exclusive policy
🗑
|
||||
show | Memory subsystem.
🗑
|
||||
show | write through
🗑
|
||||
show | virtual
🗑
|
Review the information in the table. When you are ready to quiz yourself you can hide individual columns or the entire table. Then you can click on the empty cells to reveal the answer. Try to recall what will be displayed before clicking the empty cell.
To hide a column, click on the column name.
To hide the entire table, click on the "Hide All" button.
You may also shuffle the rows of the table by clicking on the "Shuffle" button.
Or sort by any of the columns using the down arrow next to any column heading.
If you know all the data on any row, you can temporarily remove it by tapping the trash can to the right of the row.
To hide a column, click on the column name.
To hide the entire table, click on the "Hide All" button.
You may also shuffle the rows of the table by clicking on the "Shuffle" button.
Or sort by any of the columns using the down arrow next to any column heading.
If you know all the data on any row, you can temporarily remove it by tapping the trash can to the right of the row.
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Created by:
Catst
Popular Computers sets