Computer Systems: A Programmer's Perspective (3rd Edition)
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
Question
Book Icon
Chapter 9.6, Problem 9.4PP

A.

Program Plan Intro

Virtual address:

Virtual page number (VPN) and virtual page offset (VPO) are the two components of virtual address. Virtual address is “14 bits” format.

B.

Program Plan Intro

The page size (P) is 64bytes; using the page size find the number of bits in VPN.

The formula for page size as follows:

P=2p

Substitute “P = 64” in the above formula

P=2p64=2p26=2pp=6

Therefore, the “p” value represents virtual page offset (VPO) and physical page offset (PPO).

Number of bits in VPN is calculated as follows:

n = 14

p = 6

NumberofbitsinVPN=np=146=8

The VPN has additional two more components. They are TLB tag (TLBT) and TLB index (TLBI). The TLB is “4 ways” associative with “16” entries totally. Using the TLB find the value of TLBI and TLBT.

The formula for TLB as follows:

T=2t

Substitute “T = 4” in the above formula

T=2t4=2t22=2tt=2

Therefore, the “t” value represents TLBI.

TLBI and TLBT are calculated as follows:

The “t” value represents TLBI. Therefore, the value of TLBI is “2”.

TLBI = 2

VPN = 8

TLBT=VPNTLBI=82=6

Therefore, the value of TLBT is “6”.

C.

Program Plan Intro

Physical address:

Physical page number (PPN) and physical page offset (PPO) are the two components of physical address. Physical address is “12 bits” format. The physical page offset (PPO) is identical to the virtual page offset (VPO).

D.

Program Plan Intro

The physical address has additional three more components. They are Byte offset within cache block (CO), Cache index (CI) and Cache tag (CT).

Blurred answer
Students have asked these similar questions
1. Develop a mathematical model for measuring performance based on overall memory access time with a neat diagram for the following memory design and derive the formula to calculate the Overall Memory Access Time. Main Memory : 1 Internal Cache : 1 External Cache: 1 Register S and Register B have fastest access time: Data Search order [ Registers – Internal Cache – External Cache – Memory] [Hint: Register access time is considered negligible]
I ONLY NEED 3 AND 4 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: Prog1 request 80KB, prog2 request 16KB, Prog3 request 140KB Prog1 finish, Prog3 finish; Prog4 request 80KB, Prog5 request 120kb Use first match and best match to deal with this sequence (from high address when allocated) (1)Draw allocation state when prog1,2,3 are loaded into memory?  (2)Draw allocation state when prog1, 3 finish?  (3)use these two algorithms to draw the structure of free queue after prog1 , 3 finish (4) Which algorithm is suitable for this sequence ? Describe the allocation process?
4.19.16: [5] <COD §4.6>. In this exercise, we examine how pipelining affects the clock cycle time of the processor. Problems in this exercise assume that individual stages of the datapath have the following latencies:   Also, assume that instructions executed by the processor are broken down as follows: (a) What is the clock cycle time in a pipelined and non-pipelined processor? (b) What is the total latency of an lw instruction in a pipelined and non-pipelined processor? (c) If we can split one stage of the pipelined datapath into two new stages, each with half the latency of the original stage, which stage would you split and what is the new clock cycle time of the processor? (d) Assuming there are no stalls or hazards, what is the utilization of the data memory? (e) Assuming there are no stalls or hazards, what is the utilization of the write-register port of the "Registers" unit?    No hand written and fast answer with explanation
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr