Question

A given memory system has a page size of 1 KB. If a process references memory location 9210, calculate the page number and the offset within the page. (Show all work)
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Each page is of size 1KB = 1024 bytes/locations .

Given the address /location = 9210

Divide the address by 1024 to get the no of pages/page number = 9210/1024 = 8.994140625 = here integer part is page number and decimal part is the offset in that page itself

So page number = 8

Offset = multiply by 1024 the decimal part = 1024×0.994140625= 1018 = offset in page 8

We can verify using formula :

Address location = page number*1024 +(offset)

= 1024×8 + 1018 = 8092 + 1018

= 9210 = hence proved

Add a comment
Know the answer?
Add Answer to:
A given memory system has a page size of 1 KB. If a process references memory...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Please refer the following memory system : Main memory : 64 MB Cache memory: 64 KB...

    Please refer the following memory system : Main memory : 64 MB Cache memory: 64 KB Block size of 1 KB 1. Direct Mapping Offset bits? Number of lines in cache? Line number bits? Tag size? 2. Fully Associative Mapping Offset bits? Tag size? 3. 2-way set-associative mapping Offset bits? Number of lines in cache? Set number bits? Tag size? 4. 4-way set-associative mapping Offset bits? Number of lines in cache? Set number bits? Tag size?

  • A simple paging system has a memory size of 256 bytes and a page size of...

    A simple paging system has a memory size of 256 bytes and a page size of 16 bytes. i. What is the size of the page table? ii. How many bits exist for an address, assuming 1-byte incremental addressing? iii. State p and d values (i.e. the page number and the offset). iv. Perform address translation of 64 bytes to physical address space using the page table below. 0 8 1 6 2 3 3 11 4 7

  • A simple paging system has a memory size of 256 bytes and a page size of...

    A simple paging system has a memory size of 256 bytes and a page size of 16 bytes. i. What is the size of the page table? ii. How many bits exist for an address, assuming 1-byte incremental addressing? iii. State p and d values (i.e. the page number and the offset). iv. Perform address translation of 64 bytes to physical address space using the page table below. 0 8 1 6 2 3 3 11 4 7

  • Suppose the page size in a computer system using single-level page-based memory management is 4K bytes,...

    Suppose the page size in a computer system using single-level page-based memory management is 4K bytes, calculate the page number and the offset in hexadecimal for logical addresses 0x17C244 and 0x899 (hexadecimal numbers).

  • Paging Questions 1. A page is 1 KB in size. How many bits are required to...

    Paging Questions 1. A page is 1 KB in size. How many bits are required to store the page offset? 2. A page entry has 10 bits. What is the size of the page table? 3. A logical address is 32 bits long. The page size is 4 KB. Divide the address into its page number and offset. 4. The following hexadecimal addresses are used in a system with a 20-bit logical address where the page size is 256 bytes....

  • Suppose a memory manager employs paging with page size of 4 Kbytes. It has a memory...

    Suppose a memory manager employs paging with page size of 4 Kbytes. It has a memory of 256 Mbytes. A process of size 25 Kbytes needs to be loaded into memory. Answer the following. (a) How many frames are there in the memory? (b) How many bits are necessary to represent the physical address as <frame#, offset>? (c) How many frames need to be allocated to the process? Suppose a memory manager employs paging with page size of 4 Kbytes....

  • 36.-Assume a 32 bit memory space with 16[KB] pages/frames and a two-level page table. Answer the...

    36.-Assume a 32 bit memory space with 16[KB] pages/frames and a two-level page table. Answer the following questions: a).-what is the size of the page table in bytes needed for a process that has only 64[MB] of code at the start of its virtual address range? b).-how many bits are used for address (frame) offset, and how many for page table indexing (total). Assume each page table entry has 32 bits. a).-Size of page table b).-Offset bits b).-Page table indexing...

  • In C++ l. Assume that a system has a 32-bit virtual address with a 4-KB page...

    In C++ l. Assume that a system has a 32-bit virtual address with a 4-KB page size. Write a program that is passed a virtual address (in decimal) on the command line and have it output the page number and offset for the given address. As an example, your program would run as follows: yourprogram 19986 Your program would output: The address 19986 contains: Page number = 4 Offset = 3602 Writing this program will require using the appropriate data...

  • A computer system has a 64 KB main memory and a 4 KB (data area only) cache. There are 8 bytes/ca...

    A computer system has a 64 KB main memory and a 4 KB (data area only) cache. There are 8 bytes/cache line. Determine (1) the number of comparators needed and (2) the size of the tag field, for each of the following mapping schemes: a. Fully associative A computer system has a 64 KB main memory and a 4 KB (data area only) cache. There are 8 bytes/cache line. Determine (1) the number of comparators needed and (2) the size...

  • Consider a computer system with a 32-bit logical address and 8-KB page size. The system supports...

    Consider a computer system with a 32-bit logical address and 8-KB page size. The system supports up to 1GB of physical memory. How many entries are there in a page table?

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT