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

Ask an Expert

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

Write your message here..

Related Questions

What is the concept of an atomic operation, Question: Concurrency and Sync... Question: Concurrency and Synchronization a) Define the following terms: I. Critical section II. Mutual Exclusion III. Deadlock IV. Starvation. b) Name three methods w

Managing outside communication, Problem: Managing Outside Communication... Problem: Managing Outside Communication. a. What is the principal action we use when communicating through a web browser? b. Give an example of how to preaddress an email

Calculate the average waiting time, Calculate the Average Waiting Time ... Calculate the Average Waiting Time CPU burst time points out the time, the process needs the CPU. The subsequent are the set of processes with their respective CPU burst time (

Determine a processing that is not a part of synthesis phase, Determine a p... Determine a processing that is not a part of Synthesis phase  Perform LC processing is not a part of Synthesis phase

Activities of operating system-secondary-storage management, Q. What are th... Q. What are the three main activities of an operating system in regard to secondary-storage management? Answer: 1) Free-space management 2) Storage allocation 3) Disk

Explain the purpose of command-line application, Question: a) The follo... Question: a) The following questions refers to Windows XP networking: i) Briefly, explain how a host joins a network using DHCP? ii) Which IP address could be assigned to a

Determine scheduling policy for time-shared operating system, Determine a s... Determine a scheduling policy that is most suitable for a time-shared operating system   Round-Robin is a scheduling policy that is most suitable for a time-shared operating s

What are threads?, What are threads? A thread is alike to sequential pr... What are threads? A thread is alike to sequential programs. Single threads have a beginning, sequence and end. At any given point in time during the runtime of the thread there

Explain about demand paging, Explain about demand paging? A demand pagi... Explain about demand paging? A demand paging system is same to a paging system with swapping. Processes reside on secondary memory. When we require executing a process, we chan

Logical address to physical address case study in java, solution solution