Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 6.1, Problem 6.5PP
A.
Program Plan Intro
Lifetime of SSD:
Intel guarantees about 128 petabytes or PB (
1 PB =
B.
Program Plan Intro
Lifetime of SSD:
Intel guarantees about 128 petabytes or PB (
1 PB =
C.
Program Plan Intro
Lifetime of SSD:
Intel guarantees about 128 petabytes or PB (
1 PB =
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Operating System:
Consider a demand-paging system with a paging disk. The average disk access time is 10 milliseconds, and the average memory access time is 100 nanoseconds. Assume 0.1 percent of the access causes page faults.
What is the effective memory access time?
In order to achieve no more than 5 percent overhead due to demand paging for this system, what should the maximum page fault rate be?
during DMA operation is
Memory cycle time is 40 nsec. The maximum
word is ready it is sent to memory; similarly,
word from the memory in each DMA cycle.
J000 pim. The disk is operated in cycle
stealing mode whereby whenever one 4 byte
512 sectors/track, 1 KBscctor, rotation speed
percentage of time the CPU gets blocked
for writing. the disk interface reads a 4 byte
disk drive with the following
specifications:
surfaces,
Consider
512
tracks/surface,
The disk is operated in cycle
rpem
at least 190 ns?
Q2.
Develop a 64-bit wide memory interface that contains SRAM at locations (EEFE80000-
EEFEFFFFF) H and EPROM at locations (FF2F00000-FF2FFFFFF) H for the Pentium II µp
using 16L8 as a PLA decoder circuit. For the hypotheses 80xxx µp, if we decide to
modify the bit wide memory to 32-bit, suggest the memory locations for both memory
types and develop the memory interfacing circuit.
If you know that, the required time for reading from any single EPROM chip is 950 ns
and the up clocked at 15 MHz, how many wait states are require for doing that? Sketch
the required circuit for generating the desired number of the wait states.
Chapter 6 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 6.1 - Prob. 6.1PPCh. 6.1 - Prob. 6.2PPCh. 6.1 - Prob. 6.3PPCh. 6.1 - Prob. 6.4PPCh. 6.1 - Prob. 6.5PPCh. 6.1 - Prob. 6.6PPCh. 6.2 - Prob. 6.7PPCh. 6.2 - Prob. 6.8PPCh. 6.4 - Prob. 6.9PPCh. 6.4 - Prob. 6.10PP
Ch. 6.4 - Prob. 6.11PPCh. 6.4 - Prob. 6.12PPCh. 6.4 - Prob. 6.13PPCh. 6.4 - Prob. 6.14PPCh. 6.4 - Prob. 6.15PPCh. 6.4 - Prob. 6.16PPCh. 6.5 - Prob. 6.17PPCh. 6.5 - Prob. 6.18PPCh. 6.5 - Prob. 6.19PPCh. 6.5 - Prob. 6.20PPCh. 6.6 - Prob. 6.21PPCh. 6 - Prob. 6.22HWCh. 6 - Prob. 6.23HWCh. 6 - Suppose that a 2 MB file consisting of 512-byte...Ch. 6 - The following table gives the parameters for a...Ch. 6 - The following table gives the parameters for a...Ch. 6 - Prob. 6.27HWCh. 6 - This problem concerns the cache in Practice...Ch. 6 - Suppose we have a system with the following...Ch. 6 - Suppose we have a system with following...Ch. 6 - Suppose that a program using the cache in Problem...Ch. 6 - Repeat Problem 6.31 for memory address0x16E8 A....Ch. 6 - Prob. 6.33HWCh. 6 - Prob. 6.34HWCh. 6 - Prob. 6.35HWCh. 6 - Prob. 6.36HWCh. 6 - Prob. 6.37HWCh. 6 - Prob. 6.38HWCh. 6 - Prob. 6.39HWCh. 6 - Given the assumptions in Problem 6.38, determine...Ch. 6 - You are writing a new 3D game that you hope will...Ch. 6 - Prob. 6.42HWCh. 6 - Prob. 6.43HWCh. 6 - Prob. 6.45HWCh. 6 - Prob. 6.46HW
Knowledge Booster
Similar questions
- Answer the following questions. A. A computer system has a main memory access time as 60ns. you as a computer organization expert has been asked to reduce the memory access time to 20ns by adding a suitable cache. Assume that the miss probability is 10%. What should be the fastness of cache (in terms of access time) for this requirement? B. Consider the instruction ADD R1, X, which adds the contents of location X from the contents of register R1, and places the result in R1. Show the micro-operations used during fetch and execution phase of the instruction.arrow_forwardConsider a demand-paging system with a paging disk that has an average access time of 20 milliseconds(ms). Addresses are translated through a page table in main memory, with an access time of 2millisecond (ms) per main memory access. Assume page fault ratio is 10 percent.(a) [5 pt] Assume the paper table has two levels. What’s the effective memory access time?(b) [5 pt] To improve this time, we can add a TLB that reduces access time if the page-table entry is inthe TLB. Assume access time to TLB is 0.5 millisecond (ms) and 80 percent of the accesses hit in the TLB.Assume page table has one level. What’s the effective memory access time?arrow_forwardProblem Question 03 (CO3) [0.5 + 0.5 = 1]: Given below are the contents of several Intel 8086 registers and PHYSICAL memory addresses (ALL in hexadecimal): Registers: Memory Locations [Physical Address] = Contents [05000] = 3300 [06000] = 4444 [07000] = 5555 [95000] = 367A [96000] = 6666 [97000] = 10C5 DI = 3000 %3D BX = 3000 %3D ВР 3 С345 For the following instructions, determine the contents of AX after the each of the instruction has been executed: (а) MOV (b) MOV АХ, ВР АХ, [ВХ+DI] AX = AXarrow_forward
- 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?arrow_forwardConsider a swapping system in which memory consists of the following hole sizes in memory order: 10 MB, 4 MB, 20 MB, 18 MB, 7 MB, 9 MB, 12 MB and 15 MB. Which hole is taken for successive segment requests of (i) 12 MB (ii) 10 MB (iii) 9 MB for first fit? Now repeat the question for best fit and worse fit.arrow_forward7arrow_forward
- Problem 4. Consider a memory system with a cache and main memory. It takes 10ns to access the cache, and 100ns to access the main memory. If the effective (memory) access time is 10% greater that the cache access time, what is the hit ration H?arrow_forwardI need within 30 minsarrow_forwardConsider a swapping system in which main memory contains the following hole sizes in memory order: 10K, 4K, 20K, 18K, 7K, 9K, 12K, and 15K. Which hole is taken for successive segment requests of (a) 12K, (b) 10K and (c) 9K for Worst-Fit ?arrow_forward
- Problem 4. There are two levels L1 and L2 of caches. L1 has hit rate 95%, and L2 has hit rate 80%. L1 has I cycle to access. L2 has 20 cycles to access. Memory has 400 cycles to access. Ignoring memory access clocks per instruction (CPI) has 1 cycle. Assume that 40% instruction has data access. Compute the CPI that includes memory access. You need to consider that there is a memory access to fetch each instruction.arrow_forwardInstruction class Frequency% 50 % CPI of MI CPI of M2 30 % 20% 3 4. 4. 2. Determine the average CPI for each MI and M2 b. Which machine is faster? And by how much? c. Calculate MIPS rating for MI and M2? d. Assume M1 has 8 core's CPU. The programmers reprogram p such that 90% of its source codes are fully parallelized. Determine the speedup gained when compared with the sequential version of p? Finally, determine the efficiency?arrow_forwardPlease answer the full question correctly otherwise I will dislikearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education