Assume that there are two types of memories: the smaller, more expensive, faster memories and the larger, cheaper, slower memories. Suppose the processor has access to these two levels of memory. If the word that is being accessed is found in the faster memory, the processor directly accesses it, and this is known as a hit. If the word is in the slower memory, the word is first transferred into the faster memory and then accessed by the processor. The latter is known as a miss. In the scenario above, calculate the average time to access a word, given: T1 (time to access faster memory) = 0.1µs T2 (time to access slower memory) = 1µs The time to transfer data between the slower and faster memories can be ignored Hit rate (probability of finding a given word in the faster memory) = 95%

Assume that there are two types of memories: the smaller, more expensive, faster memories and the larger, cheaper, slower memories. Suppose the processor has access to these two levels of memory. If the word that is being accessed is found in the faster memory, the processor directly accesses it, and this is known as a hit. If the word is in the slower memory, the word is first transferred into the faster memory and then accessed by the processor. The latter is known as a miss. In the scenario above, calculate the average time to access a word, given: T1 (time to access faster memory) = 0.1µs T2 (time to access slower memory) = 1µs The time to transfer data between the slower and faster memories can be ignored Hit rate (probability of finding a given word in the faster memory) = 95%

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

If we already have RAM (random access memory), which may be used as volatile memory and has a very similar architecture to cache memory, then cache memory could appear unneeded. Can a computer function with only one kind of memory?
Suppose the RAM for a certain computer has 256M words, where each word is 16 bits long. a. What is the capacity of this memory expressed in bytes? b. If this RAM is byte addressable, how many bits must an address contain? c. If this RAM is word addressable, how many bits must an address contain?
Imagine we have a small computer which contains a simplified version of a CPU and RAM. The CPU can execute a single program that is stored in the RAM, and while running the program it can access 3 memory locations: its internal register AL, and two RAM locations that we'll call address 1 and address 2. Since this is a simplified computer it is able to skip some of the steps to access memory that are in our textbook, but accessing RAM still takes longer than accessing AL. The only values this computer is capable of storing in memory are unsigned bytes (8 bit binary numbers), and when it starts running a program all 3 of its memory locations initially contain the value 00000000. Here is a list of all of the instructions our imaginary computer can perform: Write [number] to AL This instruction takes the operand [number], which must be an 8-bit binary number, and puts it into AL. This overwrites whatever was in AL previously. It takes 3 cycles to complete: 1 cycle each to fetch, decode,…
When we already have RAM (Random Access Memory), which is a kind of memory that is regarded as volatile, why do we need cache memory?Both cache memory and random access memory (RAM) rely on electrical parts known as transistors. If it's even conceivable, can a computer do all of its operations using only one kind of memory?
For a microprocessor to operate, let assume that it requires 2MB of RAM and 7MB of ROM. What is the minimum number of address lines the microprocessor must support? Draw a memory map of the system, assuming that the addresses for the RAM are below the addresses for the ROM.
How Vector clock works? Illustrates with 3 processes, when the clock ticked for 7, 5, 3 times in P1, P2 and P3 respectively. Please don't write in your handwriting
When a CPU interrupt comes in, the processor stops what it's doing and responds to the signal. Why should the operation stop so that this task can be done? Let's start with the process of stopping and then move on to the process of carrying out. explain?
Write a program to find the average of 32 bytes started at memory location [Mem 1]. If the average is greater than 42H then store the average at memory location [Mem 2] otherwise, store it at memory location [Mem 3].(microprocessor)
The next job might be carried out while the CPU waits for an interrupt. Do we need to pause the sentence? Instead of worrying about the finer points, why don't we just go ahead and do the operation?
Imagine a world where it is impossible to move computer code from one device to another. Memory paging might become more difficult in this way. And what would happen if there wasn't any way to move programs around on a computer? The paging process in memory can be made more difficult in this way.
When a CPU interrupt occurs, the process is stopped and acknowledged, and the CPU moves on to the next one.Why shouldn't the process be stopped while it's still in progress?Why can't we just finish the execution and clean up instead of dealing with the problem after the fact?
Imagine that every piece of code in a piece of software is always tied to its present position. Is there a way to make the memory switching process more difficult?