Dynamically linked segmentation system, Operating System

Sharing segments between processes without requiring the same segment number is possible in a dynamically linked segmentation system.

a. Define a system that permits static linking and sharing of segments without requiring that the segment numbers be the same.

b. Describe a paging scheme that permits pages to be shared without requiring that the page numbers be the same.

Answer: Both of these problems decrease to a program being able to reference both its own code and its data without knowing the segment or page number associated with the address. MULTICS solved this difficulty by associating four registers with each process. One register had the address of the existing program segment another had a base address for the stack another had a base address for the global data and so on. The idea is that all references have to be indirect during a register that maps to the current segment or page number. Through changing these registers the same code can execute for different processes without the same page or segment numbers.

Posted Date: 7/27/2013 5:14:28 AM | Location : United States







Related Discussions:- Dynamically linked segmentation system, Assignment Help, Ask Question on Dynamically linked segmentation system, Get Answer, Expert's Help, Dynamically linked segmentation system Discussions

Write discussion on Dynamically linked segmentation system
Your posts are moderated
Related Questions
Q. Consider the two-dimensional array A: int A[][] = new int[100][100]; Whereas A [0][0] is at location 200 in a paged memory system with pages of size 200. A little process

Synchronization can be achieved by means other than locks and condition variables. One alternative is semaphores. A semaphore is used to regulate traf?c in a critical section. A se

Explain the Communications of Request or Response Interface The inter-application communication must provide four specific interface to the CSInterface() components. A client m

What are the drawbacks of contiguous allocation of disk space? The disadvantages are a. Suffers from internal fragmentation b. Suffers from external fragmentation c. F

Define where a Program generation activity aimsĀ  Program generation activity aims at Automatic generation of program

Determine the Requiring Variables on the Scope of a Thread It is very common in server application programs to require variables on the scope of a thread. To provide such a sco

Q. Suppose that you want to utilize a paging algorithm that requires a reference bit (such as second-chance replacement or working-set model) however the hardware does not provide

what do you mean by starvation?explain in detail

Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU

What problems arise if the directory structure is a general graph? Searching for a particular file may result in searching the similar directory many times. Deletion of the fil