Question from OS
In a system that uses paging, a process cannot access memory that belongs to another process. Why? Why is it theoretically possible with segmentation but not paging?
An address on a paging system is a logical page number and an offset. The physical page is found by searching a table based on the logical page number to produce a physical page number. Because the operating system controls the contents of this table, it can limit a process to accessing only those physical pages allocated to the process. There is no way for a process to refer to a page it does not own because the page will not be in the page table. To allow such access, an operating system simply needs to allow entries for non-process memory to be added to the process page table. This is useful when two or more processes need to exchange data they just read and write to the same physical addresses (which may be at varying logical addresses). This makes for very efficient inter process communication. With segmentation, you only need a small amount of information - the segment descriptor - to share, instead of changing protection on a large number of pages. In addition, you don't have to worry about mapping the code to the same address - the addresses within the code are relative to the segment, so it can be relocated more easily.
Question from OS In a system that uses paging, a process cannot access memory that belongs...
Challenge Question One On a system with paging, a process cannot access memory that it does not own. Why? How could the operating system allow access to other memory? Why should it or should it not? Challenge Question Two What is the purpose of paging the page tables?
Question 30 7 pts Consider a computer system that uses virtual memory with paging with a TUB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns)
7 pts Question 30 Consider a computer system that uses virtual memory with paging with a TLB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns) 11ns
Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference, if the page-table entry is in the associative memory. Assume that 80...
Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference, if the page-table entry is in the associative memory. Assume that 80...
II. (a) An OS is using two-level paging to implement a 28-bit virtual address space per process. The page size is 256-bytes, and the machine does not have a TLB. Explain the steps involved in looking up the virtual address 0x03bf04d, when all pages are present in memory. (2 points) (b) For the system above, what is the maximum number of page faults that could be generated in response to a memory access? (2 points)
A computer uses virtual memory implemented by paging. The TLB lookup takes 100 ns and the update takes 200 ns. The PT lookup takes 1 µs and the update takes 2 µs. Loading a word from main memory onto the CPU takes 10 µs and loading a page from the disk into main memory takes 10 ms. The TLB hit ratio is 0.4 and the main memory hit ratio is 0.3. Compute the average access time for a referenced word:...
2. A computer uses virtual memory implemented by paging. The TLB lookup takes 150 ns and the update takes 300 ns. The PT lookup takes 2 us and the update takes 4 us. Loading a word from main memory onto the CPU takes 25 us and loading a page from the disk into main memory takes 20 ms. The TLB hit ratio is 0.3 and the main memory hit ratio is 0.4. Compute the average access time for a referenced...
Consider a computer system that uses a paging system. The memory contains 16 frames, each frame can accommodate 512 memory locations (size of frame = 512). The page table is as follows: Page Number 0 1 2 3 4 5 6 7 Frame Number 5 3 10 0 2 9 11 14 What are the physical addresses for the following logical addresses? Show your work Logical Address Physical Address 2345 1024 6780
Operating System! Please provides the answer for the following Question? How does the OS have direct privilege access to system software ? Why do we need only the OS to have direct privilege access to system software? How does the OS ensure the applications are isolated and protected from one and another? How does the OS have direct privilege access over computer hardware?