Question

I need help with this problem.Exercise 1 Consider a computer system using paging, where the address space of every process has a size of C 2 bytes and theI am currenlty struggelling with it.

  1. Consider a computer system using paging, where the address space of every process has a size of C = 2c bytes and the page size is S = 2s bytes. Each entry in the page table uses E bytes.

    1. Calculate the number of pages of a process, and the size of a page table (in bytes).

    2. Assume that the space wasted by a process in main memory is defined as the sum of the size of its page table plus the average internal fragmentation due to that process (i.e., one full page on average, considering that half of a page containing the heap and half of a page containing the stack are empty on average). Obtain the optimum page size, i.e., the page size that minimises the waste of space due to a process. Hint: put the wasted space as a function of the page size, and then optimise with respect to it.

3. Calculate the optimum page size assuming that C = 4 MiB and E = 4 B.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

2S bytes Page sige C-s ager 4ge table en eb enxtry s)e) Page ニac-s E Bytes wastage page table Ssizeinterna vagnentation ニ(Num

Add a comment
Know the answer?
Add Answer to:
I need help with this problem.I am currenlty struggelling with it. Consider a computer system using paging, where the address space of every process has a size of C = 2c bytes and the page size is S...
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
  • Consider a simple paging system with the following parameters: 232 bytes of physical memory; page size...

    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 entries in the page table? How many bits in each page table entry? Assume each page table entry contains a valid/invalid bit.

  • 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

  • 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

  • 6) Paging [26 pts] Suppose you have a computer system with a 38-bit logical address, page size of 16K, and 4 bytes per...

    6) Paging [26 pts] Suppose you have a computer system with a 38-bit logical address, page size of 16K, and 4 bytes per page table entry a) How many pages are there in the logical address space? Suppose we use two level paging and each page table can fit completely in a frame. [4 pts] How many pages? [2 pts] Show your calculations here: b) For the above-mentioned system, give the breakup of logical address bits clearly indicating number of...

  • 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...

  • 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...

  • 10. Write a one-page summary of the attached paper? INTRODUCTION Many problems can develop in activated...

    10. Write a one-page summary of the attached paper? INTRODUCTION Many problems can develop in activated sludge operation that adversely affect effluent quality with origins in the engineering, hydraulic and microbiological components of the process. The real "heart" of the activated sludge system is the development and maintenance of a mixed microbial culture (activated sludge) that treats wastewater and which can be managed. One definition of a wastewater treatment plant operator is a "bug farmer", one who controls the aeration...

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