Size of each partition = 2^16 bytes
Size of main memory = 2^24 bytes
As the partitions are equally sized, the number of partitions in the memory = 2^24 / 2^16
= 2^8 partitions
So the number of bits required for a pointer to identify a partition = 8 bits
Suppose you have a memory system using fixed-size partitions with all partitions the same size, 216 bytes and a total main memory size of 227 bytes. In the process table there is a pointer to a partition for each resident process. How many bits are needed for this pointer?
In a system employing a memory management strategy that doesn't require an entire process to be in main memory at one time; the portion of a process that is actually in main memory at any given time is defined to be the resident set of the process. True False The modify (M) bit is a control bit in a page table entry that indicates whether the contents of the corresponding page have been altered since the page was last loaded...
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.
Consider a pure paging system that uses 32-bit addresses (each of which specifies one byte of memory), contains 2 GB of main memory, and has a page size (ps) of 8 KB. 1. Given 32-bits for each PTE, how many total bytes of memory are required to store the 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 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...
Suppose we have 2^20 bytes of virtual memory and 216 bytes of physical main memory. Suppose the page size is 2^8 bytes. a) How many pages are there in virtual memory? b) How many page frames are there in main memory? c) How many entries are in the page table for a process that uses all of virtual memory?
Really don't know what its about... Course in operating system, file system Question 2. File Systems (10 marks) (a) Consider a 32GB hard disk and a FAT file system with 24 bits cluster (block) address. What is the minimum block (cluster) size in order to fully utilize all space in the hard disk? (3 marks) (b) Consider an index-based file system with the inode containing 64 direct pointers, 1 indirect pointer, and 1 double-indirect pointer. Suppose the size of a...
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...
computer architecture Virtual memory 4 physice memar Assume a 64 bit machine with 40 bit addresses, and 16GB of actual memory. Memory blocks are 4K 1. How many bits in the virtual memory INDEX and OFFSET fields? 2. What fields do you need in a page table entry, and how many bits are needed for each? How many bytes do you need for each page table entry? (each entry is allocated in a whole number of bytes, even if there...