Dynamically linked segmentation system, Operating System

Assignment Help:

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.


Related Discussions:- Dynamically linked segmentation system

Declare some applications of open source systems, Declare some Applications...

Declare some Applications of Open Source Systems • Finance • Educational • Data Storage and Management • ERP (Enterprise Resource Planning) •File Sharing & FTP

Draw and r chart and an x-bar chart, Thermostats are subjected to rigorous ...

Thermostats are subjected to rigorous testing before they are shipped to air conditioning technicians around the world. Results from the last five samples are shown in the table. D

What is page fault?, What is page fault? In the computer storage techno...

What is page fault? In the computer storage technology a page fault is an exception which is raised by the memory management unit when a requested page isn't mapped in physical

Sharing memory, As we have discussed, page tables map virtual page addresse...

As we have discussed, page tables map virtual page addresses to physical page addresses. One of the advantages of using virtual addresses is that we can achieve complete separation

Determine the value to be loaded in relocation register, Refer a program wi...

Refer a program with a linked origin of 5000. Suppose the memory area allocated to it have the start address of 70000. Determine the value to be loaded in relocation register?

Process execution priorities, Priority Scheduling leads to the risk of star...

Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p

Describe the actions of sun ultra sparc processor, Q. The Sun Ultra SPARC p...

Q. The Sun Ultra SPARC processor has numerous register sets that describe the actions of a context switch if the new context is previously loaded into one of the register sets. Wha

Permanently starves cpu-bound programs, Q. Presume that a scheduling algori...

Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algori

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd