What effect would updating a few byte on the one page, Operating System

Q. What is the effect of permitting two entries in a page table to point to the same page frame in memory? Describe how this effect could be used to decrease the amount of time needed to copy a large amount of memory from one place to another. What effect would updating a few byte on the one page have on the other page?

Answer: By permitting two entries in a page table to point to the same page frame in memory users can share code and data. If the code is re-entrant a lot memory space can be saved through the shared use of large programs such as text editors and compilers and database systems. Copying large amounts of memory could be consequence by having different page tables point to the same memory location.

Nevertheless sharing of non-re-entrant code or data means that any user having access to the code can modify it and these modifications would be reflected in the other user's copy.

Posted Date: 7/27/2013 5:11:30 AM | Location : United States







Related Discussions:- What effect would updating a few byte on the one page, Assignment Help, Ask Question on What effect would updating a few byte on the one page, Get Answer, Expert's Help, What effect would updating a few byte on the one page Discussions

Write discussion on What effect would updating a few byte on the one page
Your posts are moderated
Related Questions
Q. Explain the Concept of Process? A process is sequential program in execution. A process states the basic unit of computation for the computer. Components of process are:

What lead to the concept of paging? The main memory is separated into two parts that are one for the resident operating system, and one for the user processes. We may perhaps p

Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c

Define the properties of Interactive operating system Interactive:- This system is composed of many short transactions where the results of the next transaction may be unpred

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that put back the page that will not be us

Write an application that does the following:(1) fill an array with 50 random integers; (2) loop through the array, displaying each value, and count the number of negative values;

Long term scheduling Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it cont

what is independent process? distinguished between independent process and co-operating process

List the Coffman's conditions that lead to a deadlock. Mutual Exclusion : Only one process might be use a critical resource at a time. Hold & Wait: A process may be alloc

Describe the technique of packing. The physical record size will not accurately match the length of the desired logical record and the Logical records may even differ in length