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


Define Instance. An instance is an administrative unit in which components of R/3 systems giving one or more services are grouped together.  The services offered by a case are

what are disadvantages of using single directory

What is segmentation? In a segmented memory management scheme a programmer views a program to be collection of program components called as segments. Every segment is a logical

Usually memory is allocated from a large pool of unused memory area called the heap. In C++, dynamic allocation/deallocation must be manually performed using commands like malloc,

Question: a) Windows Server 2003 has brought great enhancements the Server System as compared to the previous version. Write down short notes on the below listed enhancements.

Q. Consider the following page-replacement algorithms. Rank the algorithms on a five-point scale from "bad" to "perfect" according to their page-fault rate. Detach those algorithm

Q. It is occasionally said that tape is a sequential-access medium whereas magnetic disk is a random-access medium. In fact the correctness of a storage device for random access d

When the Page fault frequency in an operating system is reduced Locality of reference is appropriate to the process