Describe two segment-replacement algorithms, Operating System

Assignment Help:

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since segments aren't the same size the segment that is chosen to be replaced mayn't be big enough to leave enough consecutive locations for the needed segment. Consider tactics for systems where segments cannot be relocated and those for systems where they can.

Answer:

a. FIFO. Find the first segment large sufficient to accommodate the incoming segment. If relocation isn't possible and no one segment is large enough select a combination of segments whose memories are contiguous which are closest to the first of the list and which are able to accommodate the new segment. If relocation is probable rearrange the memory so that the first N segments large sufficient for the incoming segment are contiguous in memory. Add any leftover space to the free-space list in both cases.

b. LRU. Select the segment that hasn't been used for the longest period of time and that is large enough adding any leftover space to the free space list. If no one segment is large sufficient select a combination of the oldest segments that are contiguous in memory (if relocation isn't available) as well as that are large enough.

If relocation is obtainable rearrange the oldest N segments to be contiguous in memory as well as replace those with the new segment.


Related Discussions:- Describe two segment-replacement algorithms

Typical virtual memory layout, Using pages makes it easier to manage the wh...

Using pages makes it easier to manage the whole memory, avoiding excessive fragmentation and waste. As an analogy, think of Tetris, but with only square blocks: it is relatively ea

unix script command and echo command, Objectives 1.    Login to UNIX ...

Objectives 1.    Login to UNIX system and logout 2.    Learn features of the vi editor and to use online help (main pages).  Gain experience using them to create a document

Protection, protection in operating system

protection in operating system

Changing the runlevel of system from 5 to 3 on startup, Front page We n...

Front page We need to continue or customization and documentation of our system. Currently our system boots into runlevel 5 and we need it to boot into runlevel 3. For future r

What is the main difficulty real-time environment, What is the main difficu...

What is the main difficulty that a programmer must overcome in writing an operating system for a real-time environment? The main difficulty is keeping the operating system with

Thread safety, What does it mean for something to be thread-safe? By saying...

What does it mean for something to be thread-safe? By saying that X is thread-safe, we mean that if multiple threads use X at the same time, we don't have to worry about concurrenc

Write in brief on unix file structure, Write in brief on UNIX file structur...

Write in brief on UNIX file structure. UNIX considers every file to be a sequence of 8-bit bytes no interpretation of these bits is made by the operating system. This system pr

#title. operation research, What are the features of Operation Research app...

What are the features of Operation Research approach?

Explain linked allocation, Linked allocation With linked allocation, ev...

Linked allocation With linked allocation, every file is a linked list of disk blocks; the disk blocks might be scattered anywhere on the disk. The directory has a pointer to th

What are the different types of semaphore?, What are the different types of...

What are the different types of semaphore? Principally the semaphore is able to be classified into two on the basis of their values a)      Counting semaphore: In counting s

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