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
Consider the subsequent resource-allocation policy. Requests as well as releases for resources are allowed at any time. If a request for resources can't be satisfied because the re

The physical memory acts as a cache backed by the disk. When the physical memory is full, and we want to read in another page from disk, we have to evict a page from physical memor

To explore the UNIX file system, use basic UNIX commands and use a text editor. Task:   1.      Logon to Linux. 2.      Create a directory "Unix" under your home d

Question : a) Describe the difference between the authentication of a user account on a peer to peer network and a client server network. b) Compare an end user account with

Explain Belady's Anomaly? Also called FIFO anomaly. Usually, on enhancing the number of frames allocated to a process virtual memory, the process implementation is faster, beca

Question: Concurrency and Synchronization a) Define the following terms: I. Critical section II. Mutual Exclusion III. Deadlock IV. Starvation. b) Name three methods w

Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in

Explain thread in details

The code should be nicely formatted with plenty of comments. It should be easy to read, properly The summary section should include three parts: (1) Record the running t

how response times are reduced by allowing time sharing on top of multiprogramming