Recall that paging is implemented by breaking up
an address into a page and offset number. It is most efficient to break the
address into X page bits and Y offset bits, rather than perform arithmetic on
the address to calculate the page number and offset. Because each bit position
represents a power of 2, splitting an address between bits results in a page
size that is a power of 2.
Subscribe to:
Post Comments (Atom)
Java - Operations
3.1 Arithmetic Operators Java supports the following arithmetic operators: Operator Description Usage Exampl...
-
Dynamic Loading : o Routine is not loaded until it is called o Better memory-space utilization; unused routine is never loaded....
-
3.1 Arithmetic Operators Java supports the following arithmetic operators: Operator Description Usage Exampl...
-
Thrashing is caused by under allocation of the minimum number of pages required by a process, forcing it to continuously page fault. The sy...
No comments:
Post a Comment