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
Process states in Linux OS Running:  Process is either ready to run or running Interruptible:  a Blocked part of a process and waiting for a signal or an event from anothe

When programming with threads, there are three very common mistakes that programmers often make: 1. locking twice (depending on the system and type of lock, can cause crashes, h

Define Server Processing with Queues The efficient server processing of client request is essential for optimized client- server applications. This process is greatly enhanced

From hardware perspective, every information system can be divided into three task areas Presentation, Application Logic and Data Storage. The R/3 Basis software is extremely s


Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

FIXED PARTITIONING Using fixed partitioning we are able to allocate the memory Here we are dividing the memory into a few fixed partitions.Every partition may not be of the si

What are the various layers of a file system? The file system is composed of many dissimilar levels. Each level in the design uses the feature of the lower levels to make new f

The term IPC (Inter-Process Communication) defines several paths by which different process executing on some operating system interact between each other.

code for implementing NFU page replacement algorithm