5) Consider a memory system with the following parameters: T(c) 150 ns P(c)-0.01 cents / bit...
7.3 What is the memory layout of the 16-bit value, 0x7654 in a big-endian 16-bit machine, and a little-endian 16-bit machine? b. What would the layouts be in 32-bit machines? 7.19 A certain two-way set-associative cache has an access time of 4 ns, compared to a miss time of 60 ns. Without the cache, main memory access time was 50 ns. Running a set of bench-marks with and without the cache indicated a speedup of 90%. What is the approximate...
6. Memory Access Time [15 points] Consider a MIPS processor that includes a cache, a main memory, and a hard drive. Access times of cache memory, main memory, and hard drive are 5 ns, 200 ns, and 1000 ns, respectively. Assume that cache memory is divided into instruction cache and data cache. Assume that data cache has a 90% hit rate. Assume that main memory has a 98% hit rate and hard drive is perfect (it has a 100% hit...
1. Cache memory (8pts) Consider adding cache to a processor-memory system design. The microprocessor without cache needs 12 clock cycles to read a 16-bit word from the memory. With cache, it takes only 4 clock cycles if the data happens to be in the cache and a total 20 clock cycles including the cache misses. a. What is the performance ratio of the cache system to the non-cache system given a hit rate of 80%? b. For what hit rate...
1. Cache memory (8pts) Consider adding cache to a processor-memory system desigrn. The microprocessor without cache needs 12 clock cycles to read a 16-bit word from the memory. With cache, it takes only 4 clock cycles if the data happens to be in the cache and a total 20 clock cycles including the cache misses a. What is the performance ratio of the cache system to the non-cache system given a hit rate of 80%? b. For what hit rate...
Consider the following system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The system utilizes a fully-associative TLB with 4 entries and an LRU replacement policy. Given the access pattern and timings below, complete the following table. Assume the TLB begins initially empty and the cache is physically addressed NOTE: Access times are not inclusive and components are accessed sequentially. Time to update the TLB is negligible, everything else that needs to be updated will require a...
Question 30 7 pts Consider a computer system that uses virtual memory with paging with a TUB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns)
7 pts Question 30 Consider a computer system that uses virtual memory with paging with a TLB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns) 11ns
Please answer the following questions about paged memory... A) How much space needs to be allocated in the minimum and maximum cases for a two-level page table for a machine with a 32-bit virtual memory address, a 1K page size, and which has four times as many inner pages as outer pages? Assume any stored page table value requires 32 bits. B) For the two-level paging approach above, if a Translation Lookaside Buffer (TLB) is used and can cache both...
Consider a memory hierarchy using one of the three organization for main memory shown in a figure below. Assume that the cache block size is 32 words, That the width of organization b is 4 words, and that the number of banks in organization c is 2. If the main memory latency for a new access is 10 cycles, sending address time is 1 cycle and the transfer time is 1 cycle, What are the miss penalties for each of...
1a. convert the following decimal number to 32 bit single precision Floating point binary number and convert that binary number to hexadecimal NUMBER = -134.5 in decimal b. convert the following 32-bit single precision floating point number to decimal: 01000111111100000000000000000000 2. Using Booth's algorithm, multiply the decimal numbers -12 and +13. 3. you have two improvement alternatives, which is better and why? The first one improves 15% of the instructions, and it improves that speed by a factor of 6....