Mechanism by which one segment belong to two address spaces, Operating System

Q. Explain a mechanism by which one segment could belong to the address space of two different processes.

Answer: Because segment tables are a collection of base-limit registers segments can be shared when entries in the segment table of two different jobs point to the same physical location. The two segment tables should have identical base pointers and the shared segment number should be the same in the two processes.

Posted Date: 7/27/2013 5:12:31 AM | Location : United States







Related Discussions:- Mechanism by which one segment belong to two address spaces, Assignment Help, Ask Question on Mechanism by which one segment belong to two address spaces, Get Answer, Expert's Help, Mechanism by which one segment belong to two address spaces Discussions

Write discussion on Mechanism by which one segment belong to two address spaces
Your posts are moderated
Related Questions
In this project, you will implement the Chandy and Misra's (CM) algorithm using POSIX Threads (Pthreads).   The algorithm  is a distributed algorithm to solve a generalized dining

Direct memory access Many computers avoid burdening the main CPU with programmed I/O by offloading sine if this work to a special-purpose processor known as a direct memory add

DIFFERENT MULTITHREADING MODELS Multithreading Models the majority multithreading models fall into one of the following categories of threading implementation: 1.      M

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

What is the use of FIFOs in client-server applications

At the end of this lecture, and into the next lecture, we will discuss the last major type of logical error that can occurwhen programming with threads. A deadlock occurswhen two t

What is a Dispatcher? The dispatcher is the module that gives control of the CPU to the process selected by the short- term scheduler. This function includes: Switching

SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv

Define dynamic loading. To obtain better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. All routines are ke

Demonstrate that your program (include the program output as part of the final report) can produce the correct output with the following parameters. For each case comment if the ou