Why does the bus skew phenomenon occur?

• It occurs because some Memory blocks may have different ways of spreading.

• It occurs because quickest Memory blocks may have different distances and depths.

• It occurs because similar Memory blocks may have different points of destination.

• It occurs because different lines of the bus may have different propagation speeds.

• It occurs because similar Memory blocks may have different capacities and prizes.

What’s Cache memory?

• A packet of interrupt vectors, wider and larger than Closed System, that is used to protect a protocol of instruction and data in main storage that are likely to be needed next by the network, and that have been obtained automatically from bottleneck.

• An application software, wider and deeper than Open Area network, that is used to hold a protocol of instruction and data in main storage that are likely to be needed next by the Keyboard, and that have been obtained automatically from DMA.

• A special buffer storage, smaller and faster than main storage, that is used to hold a copy of instruction and data in main storage that are likely to be needed next by the processor, and that have been obtained automatically from main storage.

• A special software, smaller and larger than Operating System, that is used to hold a copy of instruction and data in main storage that are likely to be needed next by the processor, and that have been obtained automatically from CD-ROM.

• A packet of software, wider and larger than Open System, that is used to hold a protocol of instruction and data in main storage that are likely to be needed next by the Hard Disk, and that have been obtained automatically from network.

How is the Efficiency of Cache memory characterized (estimated)?

• It is characterized by the binary and hexadecimal operations, it is equal to the sum of all misses of instructions in the Hard Disk’s Stack.

• It is characterized by the binary and hexadecimal numbers ratio, which is equal to the sum of all misses of instructions in the Hard Disk’s registers.

• It is characterized by the hit ratio, which is equal to the ratio of all hits in Cache to the number of CPU accesses to the memory.

• It is characterized by the even and hexadecimal numbers ratio, which is equal to the sum of all offsets of prefixes in the Hard Disk’s cells.

• It is characterized by the binary and decimal numbers ratio, which is equal to the ratio of all misses of instructions in the CPU registers.

What’s a Cache hit?

• The situation in which the PCI Bus word is recorded from Keyboard.

• The situation in which the Operating System is loaded from Keyboard.

• The situation in which the memory word is fetched from Cache.

• The situation in which the DMA address is missed in the Keyboard.

• The situation in which the Bus word is loaded from Keyboard.

What’s a Cache miss?

• The situation in which the PCI Bus address is stalled from Keyboard.

• The case, when the required memory word is not available in Cache.

• The situation in which the DMA buffer is missed in the protocol.

• The situation in which the Operating System is read from Keyboard.

• The case in which the PCI Bus word is visualized in the Keyboard.

What’s Cache Mapping Function?

• Method (way), which realizes algorithm for mapping main memory blocks into the Cache lines.

• Recommendation, which gives an idea for mapping network segments into the Cache disks.

• An idea, which realizes way for removing Hard Disk’s segments into the Cache routers.

• Protocol, which realizes idea for mapping Keyboard’s segments into the Cache bridges.

• History, which realizes idea for mapping Hard Disk’s segments into the Cache wires.

What’s the Direct Mapped Cache?

• If only one location in the Cache can contain the word from a particular main memory location, then we have the Direct Mapped Cache.

• If only ten locations in the Cache can contain the word from a particular main memory location, then we have the Direct Mapped Cache.

• If only two locations in the Cache can contain the word from a particular main memory location, then we have the Direct Mapped Cache.

• If only three locations in the Cache can contain the word from a particular main memory location, then we have the Direct Mapped Cache.

• If only five locations in the Cache can contain the word from a particular main memory location, then we have the Direct Mapped Cache.

Is a replacement algorithm needed for any Cache?

• It’s needed for Cache with the gold and twisted pair mapping techniques.

• It’s needed for Cache with the aluminum and twisted pair mapping techniques.

• It’s needed for Cache with the coaxial and twisted pair mapping techniques.

• It’s needed for Cache with the copper and twisted pair mapping techniques.

• It’s needed for Cache with the associative and set associative mapping techniques.

What kind of replacement algorithms are mainly used in Cache memories?

• BYU (badly-yesterday reused), RIFO (recently-in-first-out), LFU (least-frequently used), Random.

• ORU (only-recently reused), RIFO (recently-in-first-out), LFU (least-frequently used), Random.

• LRU (least-recently used), FIFO (first-in-first-out), LFU (least-frequently used), Random.

• BRU (better-recently reused), RIFO (recently-in-first-out), LFU (least-frequently used), Random.

• NRU (never-recently reused), RIFO (recently-in-first-out), LFU (least-frequently used), Random.

What’s a protocol MESI?

• To provide Cache large room the data cache supports a protocol MESI (modern/excellent/ simple/interesting).

• To provide Cache consistency the data cache supports a protocol MESI (modified/exclusive/ shared/invalid).

• To provide Cache large speed the data cache supports a protocol MESI (modern/excellent/simple/interesting).

• To provide Cache large space the data cache supports a protocol MESI (modern/excellent/simple/interesting).

• To provide Cache large area the data cache supports a protocol MESI (modern/excellent/ simple/interesting).

How are data organized on a magnetic disk?

• Data are organized on a magnetic disk in a three dimensional matrix of Ferro-magnetic rings.

• Data are organized on a magnetic disk in a four dimensional matrix of Ferro-magnetic rings.

• Data are organized on a magnetic disk in a two dimensional matrix and vacuum tubes with Ferro-magnetic rings.

• Data are organized on a magnetic disk in a concentric set of rings, called tracks, and each track of the same width as the head.

• Data are organized on a magnetic disk in a two dimensional matrix of Ferro-magnetic rings.

What’s a Computer System Memory?

• It’s a part of Operation System, which is intended for processing, storing and presentation of instructions.

• It’s functional unit, which is intended for accepting, storing and presentation of data.

• It’s software unit, which is intended for processing, storing and presentation of instructions.

• It’s program part, which is intended for processing, transportation and presentation of instructions.

• It’s software unit, which is intended for processing, storing and presentation of numbers.

Is a typical computer equipped with a single memory subsystem?

• Yes, a typical computer is equipped only with Video memory system, which is mounted outside the System Block.

• Yes, a typical computer is equipped with only one memory system, which is mounted outside the System Block.

• Yes, a typical computer is equipped with only one memory system, which is necessary for visualizing results.

• No, a typical computer is equipped with a hierarchy of memory subsystems, some internal and some external to the computer system.

• Yes, a typical computer is equipped with only one Cache memory system, which is mounted outside the Motherboard.