Why page sizes always powers of 2, Operating System

Q. Why page sizes always powers of 2?

Answer: Recall that paging is executed by breaking up an address into a page and offset number. It is most competent to break the address into X page bits and Y offset bits rather than perform arithmetic on the address to compute the page number and offset. For the reason that each bit position represents a power of 2 splitting an address between bits results in a page size that is a power of 2.

Posted Date: 7/27/2013 5:10:14 AM | Location : United States







Related Discussions:- Why page sizes always powers of 2, Assignment Help, Ask Question on Why page sizes always powers of 2, Get Answer, Expert's Help, Why page sizes always powers of 2 Discussions

Write discussion on Why page sizes always powers of 2
Your posts are moderated
Related Questions
How are file sharing and protection implemented? To implement file protection and sharing, the system ought to maintain more file and directory attributes than are needed on a

Q. Dynamically loadable kernel modules give elasticity when drivers are added to a system however do they have disadvantages too? Under what situations would a kernel be compiled

In a table format, discuss the differences between the fixed partition and the variable partition memory organization in terms of the basic idea, memory structure, advantages


Define the “Throughput” of a system  Throughput is Number of programs processed by it per unit time

SEGMENTATION In a memory management system that is properly a programmer views a program to be collection of program components called as segments . Every segment is a logical

Clocks in distributed systems : a. Why are clocks difficult to synchronize in distributed systems? b. What features in a system assume that the clocks are (reasonably) synchr

Q. Is the Internet a LAN or else a WAN? Answer: The Internet is a WAN as the a variety of computers are located at geographically different places and are connected by long-dis

Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.

Many-to-One Model (Green Threads) Implementations of the many-to-one model a lot of user threads to one kernel thread permit the application to create any number of threads tha