Question

Your task is to design the page table for the 32bit Pentium microprocessor. Answer the following...

Your task is to design the page table for the 32bit Pentium microprocessor. Answer the following questions:

  1. The virtual address space without segmentation will be 4GB. Why?

  2. Suppose that the size of each page is 4KB and each table entry takes 4B. How many entries will be needed in the linear page table and how many pages will be needed to store the table?

0 0
Add a comment Improve this question Transcribed image text
Know the answer?
Add Answer to:
Your task is to design the page table for the 32bit Pentium microprocessor. Answer the following...
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
  • 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...

  • SN 6 A system implements a paged virtual address space for each process using a one-level...

    SN 6 A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 4KB. The page table for the running process Includes the following valid entries: Virtual Virtual page 7 - Page frame 4 Virtual Virtual page 5 - Page frame 0 Virtual Virtual page 20 - Page frame 1 Virtual Virtual page 10 - Page frame 3 Virtual Virtual page 3 - Page frame 2 The...

  • A system implements a paged virtual address space for each process using a one-level page table....

    A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 8MB. The page table for the running process includes the following valid entries (the -> notation indicates that a virtual page maps to the givenpage frame, that is, it is located in that frame): Virtual page 2 -> Page frame4 Virtual page 4 -> Page frame 9 Virtual page 1 -> Page frame2 Virtual page 3...

  • Suppose a machine does not use a multi-level page table. Suppose further, that the system uses...

    Suppose a machine does not use a multi-level page table. Suppose further, that the system uses a 54-bit virtual address and a 30-bit physical address. If the page size is 16K, how many entries should you have in the page table? You may express the answer as a power of 2. (1) Is the decision to have a single level page table a reasonable one? Explain (2) If you are to use the inverted page table in this system, what...

  • A computer uses a byte-addressable virtual memory system with a four-entry TLB and a page table...

    A computer uses a byte-addressable virtual memory system with a four-entry TLB and a page table for a process P. Pages are 16 bytes in size. Main memory contains 8 frames and the page table contains 16 entries. a. How many bits are required for a virtual address? b. How many bits are required for a physical address?

  • 1. Consider a simple paging system with the following parameters: 232 bytes of physical memory; page...

    1. Consider a simple paging system with the following parameters: 232 bytes of physical memory; page size of 210 bytes; 216 pages of logical address space. How many bits are in a logical address? How many bytes are in a frame! How many bits in the physical address specify the frame? How many entries are in the page table? How many bits are in each page table entry? Assume each page table entry contains a valid/invalid bit. 2. Consider a...

  • Consider a system with 64 bit words, 48 bit addresses, 32GB of real memory and 4kB...

    Consider a system with 64 bit words, 48 bit addresses, 32GB of real memory and 4kB pages. a) How many virtual pages are there? b) How many page frames (real memory) are there? c) How many entries are needed in the page table? d) If each entry in the table requires 2 words, how big is the table?

  • Virtual memory address translation: a) Consider a machine with a physical memory of 8 GB, a...

    Virtual memory address translation: a) Consider a machine with a physical memory of 8 GB, a page size of 4 KB, and a page table entry size of 4 bytes. How many levels of page tables would be required to map a 52-bit virtual address space if every page table fits into a single page? b) Without a cache or TLB, how many memory operations are required to read or write a page in physical memory? c) How much physical...

  • 16 It is known that computer system programs use 32-bit virtual addresses to access storage units....

    16 It is known that computer system programs use 32-bit virtual addresses to access storage units. If the physical memory space of the computer system is 1GB, and the paging management mechanism is adopted, the page size is 4KB, and each page table entry is 4B. If only one level of page table is used to realize the mapping from virtual address to physical address, how much memory space does the page table occupy? A. 1MB B. 4KB C. 1KB...

  • A computer system has a 36-bit virtual address space with a page size of 8K, and...

    A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry. How many pages are in the virtual address space? What is the maximum size of addressable physical memory in this system? If the average process size is 8GB, would you use a one-level, two-level, or three-level page table? Why? Compute the average size of a page table in part c above

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