Mechanism for code and data sharing, Operating System

Q. Consider a system in which a program is able to be separated into two parts: code and data. The CPU recognizes whether it wants an instruction (instruction fetch) or data (data fetch or store). Consequently two base-limit register pairs are provided: one for instructions and one for data. The instruction base-limit register couple is automatically read-only so programs can be shared among different users. Converse the advantages and disadvantages of this scheme.

Answer: The main advantage of this scheme is that it is an effective mechanism for code and data sharing. For instance only one copy of an editor or a compiler needs to be kept in memory and this code can be shared by all processes needing access to the editor or else compiler code.

Another benefit is protection of code against erroneous modification. The only drawback is that the code and data must be separated which is typically adhered to in a compiler-generated code.

Posted Date: 7/27/2013 5:08:03 AM | Location : United States







Related Discussions:- Mechanism for code and data sharing, Assignment Help, Ask Question on Mechanism for code and data sharing, Get Answer, Expert's Help, Mechanism for code and data sharing Discussions

Write discussion on Mechanism for code and data sharing
Your posts are moderated
Related Questions
Q. Regard as a logical address space of eight pages of 1024 words every mapped onto a physical memory of 32 frames. a. How several bits are there in the logical address? b. H

What are the different methods for handling deadlocks? Deadlock detection and recovery: Permit the system to enter a deadlock state, detect it and after that rec

What are conditions under which a deadlock situation may arise? A deadlock situation can arise if the following four conditions hold simultaneously in a system: a. Mutual ex

Explain the basic method of paging method. Physical memory is divided into the fixed-sized blocks called frames. Logical memory is as well divided into blocks of the same size

Explain Process scheduling Process scheduling consists of the subsequent sub-functions: 1.      Scheduling : Selects the process to be implement next on the CPU 2.      D

Some people write custom memory allocators to meet their speci?c needs. Although this is not needed for most of the applications, it is also not uncommon. The goal, of course, is t

Q. a number of systems automatically delete all user files when a user logs off or a job terminates unless the user explicitly requests that they be kept other systems keep all fil

Define entry section and exit section. The critical section problem is to design a protocol that the processes can use to cooperate. Every process must request permission  to e

linked allocation using i node

When we download a movie from the Internet, we don't care about, say, packet sizes. However, even ifwe are not aware of howlow-level details of networks are implemented, our data i