Suppose that a processor has access to three levels of memory. Level 1 contain 2000 words and has an access time of 0.02 msec. Level 2 contain 10,000 words and has an access time of 0.2 msec. Level 3 contains 20,000 words and has an access time of 2 msec. Assume that ifa word to be accessed is in level 1, then processor access it directly.is in level 2 the word is first transferred toL, and then accessed by the processor. Similarly for Ly the word is transferred to La then to L, and then accessed. The hit ratio for level 1 is 0.65 and for level 2 is 0.45. What is the average access time (in ?

Suppose that a processor has access to three levels of memory. Level 1 contain 2000 words and has an access time of 0.02 msec. Level 2 contain 10,000 words and has an access time of 0.2 msec. Level 3 contains 20,000 words and has an access time of 2 msec. Assume that ifa word to be accessed is in level 1, then processor access it directly.is in level 2 the word is first transferred toL, and then accessed by the processor. Similarly for Ly the word is transferred to La then to L, and then accessed. The hit ratio for level 1 is 0.65 and for level 2 is 0.45. What is the average access time (in ?

Name: Suppose that a processor has access to three levels of memory. Level
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Suppose that a processor has access to three levels of memory. Level 1 contain 2000 words and has an access time of 0.02 msec. Level 2 contain 10,000 wordsand has an access time of 0.2 msec. Level 3 contains 20,000 words and has an access time of 2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Q1: Consider two computers, P1 and P2, of the same instruction set (ISA). We have a program of 7.5x10° instructions and we want to run this program on P1 and P2. The P1 computer is a 5 GHz machine with CPI of 0.8. The P2 computer is a 6 GHz machine with CPI of 1.2. Which computer is faster?
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI of 2.5 and can be run at a clock rate of 750 MHz. We have a particular program we wish to run. When compiled for computer A, this program has exactly 100,000 instructions. How many instructions would the program need to have when compiled for Computer B, in order for the two computers to have exactly the same execution time for this program? Please explain how to solve
a. We are given a system with 2 levels of cache, L1 and L2. The CPU directly interfaces to the L1 cache, which has a hit time of 1 ns and a hit rate of 0.4. On misses, the L1 accesses the L2 cache, which has an access time of 20 ns, and a hit rate of 0.8. If the L2 misses, it accesses the main memory, which has an access time of 100 ns. Determine the average memory access time, of the CPU to the memory hierarchy.b. A cache is inserted between the main memory, which is 32 MB, and the CPU. This cache can accomodate 64 blocks and each block can accomodate 128 words (2B per word). How many possible blocks can be stored in one cache block if it is a direct-mapped cache?
We have three processes that work coordinately to serve the photo printing request(pictured below). When there is a request to print a photo, Process A reads the photo data from thedisk to Buffer 1, Process B copies the data from Buffer 1 to Buffer 2, finally Process C takes the datafrom Buffer 2 and print it.Process A ------------- Process B ------------ Process C------------------------------>| Buffer 1 |-------------------------->| Buffer 2 |----------------------------->Read from File ------------- copy ------------- print Assume each process operates on one photo at a time, both buffers' capacity can store two photos.Write a program (Pseudo code) to coordinate the three processes using semaphores. (Define thesemaphores to use and initialize their values)
Suppose we have two implementations:Machine A has a clock cycle time of 10 ns. and a CPI of 2.0. Machine B has aclock cycle time of 20 ns. and a CPI of 1.2. Which machine is faster for thisprogram, and how much in percentage? Consider that the total instruction in the program is 1x10^9 or about 1,000,000,000 set of instructions since the cycle time is running in nanoseconds.
Problem 4. Suppose a program for a racing drone consists of a purely sequential part which takes 25 cycles to execute, and an iterated loop which takes 100 cycles per iteration. independent and cannot be further parallelized. If the loop is to be executed 100 times, what is the maximum speedup possible using an infinite number of processors (compared to a single processor)? Assume the loop iterations are
Single instruction computer (SIC) has only one instruction that for all operations our MIPS does. The instruction has the following format. sbn a, b, c # Mems[a]=Mem[a]- Mem[b]; if (Mem[a]<0) go to PC+c For example, here is the program to copy a number from location a to location b: Start: sbn temp, temp, 1 sbn temp, a, 1 sbn b, b, 1 sbn b, temp, 1 So build SIC program to add a and b, leaving the result in a and leaving b unmodified.
I want all staps for Consider a computer which has a memory which is capable of storing 4096 K words and each word in memory can be of size 32 bits. The computer supports a total of “6” addressing modes, and it has “8” computer registers. The computer supports instructions, where each instruction consists of following fields: • Mode • Operation code • Register • Register • Memory Address Given that each instruction will be stored in one memory word, discuss with a suitable diagram the format of instruction by specifying number of bits for each field of instruction. Discuss each field of instruction
1. Consider a machine running a program with four classes of instructions: A/B/C/D. The program requires 360 seconds, with the number of seconds executing each class as shown in the table below: Instruction Class A B C Time (sec) 100 80 120 60 1.1. By how much is the total execution time changed if the time for class D is reduced by 20% and the time for class C is increased by 10% (assuming no other changes)? 1.2. If we want to reduce the total execution time by 20% by optimizing class A only, what is the target execution time of class A instructions in order to achieve the reduction (assuming all other instructions are not changed)? 1.3. Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify your answer.
Computer Science Please use the RISC V instruction format. Implement a function that attempts to obtain a ticket a concert. The function will run on hundreds of sites, so the function must atomically decrement a shared global variable representing the number of seats still available using the load reserved, store conditional instructions. The address of the memory location storing the current number of available seats is passed into the routine and you will have to put it into a register. A Boolean value 1 is returned in X18 if a seat is available. A Boolean 0 is returned if no more seats are available. result = get_tickets(int *seats_available) { }.
In an RISC V (32-bit) microprocessor, if a0 is preloaded with data of Ox0000_1F75 and al is preloaded with data of Ox0000_32CB, then what are the values of s0 (in Hex) after each of the following logical operations (in sequence)? xor s0, a0, al xori s0, s0, 0XFFFF slli s0, s0, 16
4. The Single Instruction Computer (SIC) has only one instruction that can do all operations our RISC-V does (you did a homework problem). The instruction has the following format sbn a, b, c # Mem[a]=Mem[a]- Mem[b]; if (Mem[a]- Mem[b]<0) go to PC+c For example, here is the program to copy a number from location a to location b: sbn temp, temp, 1 sbn temp, a, 1 sbn b,b, 1 sbn b, temp 1 Start: Design a single cycle datapath and control for this instruction set architecture.