retagged by
757 views

1 Answer

Best answer
5 5 votes
The logical address looks as follows:
Page Number     Offset
 m-n bits            n bits

$$\begin{array}{|c|c|c|} \hline \text{Page Number} & \text{Offset} \\ \hline m-n\:\text{bits} & n\:\text{bits}\\ \hline  \end{array}$$
The size of the page, which is also equal to frame size is defined by hardware. If the logical address is m bit long, we have n bits for offset and higher-order m- n bits for pages.

1. We have in all 8 pages. To store info. about 8 pages we require 3 bits. This means page number needs 3 bits.
2. To address 1024 (= 2^10) words in each page, we need 10 bits, since 2^10 = 1024. Thus, the offset needs 10 bits.
The total address size = number of bits for page index + number of bits for offset = 10 + 3 = 13 bits
edited by
Answer:
Position:
Show:

Related questions

2 2 votes
3 answers 3 answers
3.1k
3.1k views
Bikram asked Dec 26, 2016
3,134 views
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns.The ...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
Bikram asked Dec 26, 2016
1,243 views
A moving arm disk-storage device has the following specifications. Number of tracks per recording surface – $200$ Disk – rotation speed – $2400$ rpm Track storage capacit...
1 1 vote
1 answers 1 answer
1.4k
1.4k views
Bikram asked Dec 26, 2016
1,414 views
Suppose the disk drive has $200$ cylinders ( numbered $0$ to $199$). The drive is currently serving the request at cylinder $53$. The previous request was at cylinder $2...
0 0 votes
1 answers 1 answer
1.8k
1.8k views
Bikram asked Dec 26, 2016
1,803 views
Assume we have a demand-paged memory. The page table is held in registers. It takes $8$ milliseconds to service a page fault if an empty page is available or the replaced...