Define implementation of segmentation with an example, Operating System

Assignment Help:

IMPLEMENTATION OF SEGMENTATION WITH AN EXAMPLE

Segmentation is a memory-management scheme that represents the user view of memory. A logical address space is the collection of segments. Every segment has a name and a length. The addresses specify both the offset and the segment name within the segment. The user thus specifies each address by two quantities: an offset and a segment name. For the simplicity of execution, the segments are numbered and are referred to by a segment number, relatively than by a segment name. Therefore, the logical address consists of a two tuple segment-number offset   

Execution is defined to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is distressed by segment table. Every entry in the segment table has a segment limit and a segment base. The segment base holds the starting address where the segment resides in memory, while the segment limit specifies the length of the segment.

A logical address consists of two parts an offset and a segment number, s, into that segment d. The segment number is utilized as an index to the table. The offset d of the logical address should be between 0 and the segment limit. The segment table is basically an array of base-limit register pairs.

 

1357_Implementation of  SEGMENTATION.png


Related Discussions:- Define implementation of segmentation with an example

Name the hardware to support demand paging, The hardware to support demand ...

The hardware to support demand paging is as follows Page table: This table has the skill to mark an entry invalid though a valid-invalid bit or particular value of protectio

Array-initialization loops using lru replacement algorithm, Q. Consider th...

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

How many disks can be used effectively by one fast wide bus, Q. More than ...

Q. More than one disk drive is able to be attached to a SCSI bus. Especially a fast wide SCSI-II bus can be connected to at most 15 disk drives. Remember that this bus has a bandw

Write a short note on disk scheduling, Write a short note on disk schedulin...

Write a short note on disk scheduling   One of the responsibities of operating system O/S is to use the hardware efficiently. Whenever a process requires I/O to or from the

Perform alpha-beta pruning on the following tree, Perform alpha-beta prunin...

Perform alpha-beta pruning on the following tree. Put an "X" over each node that is pruned. Put the final value next to all other nodes. Indicate which action MAX should take: to B

Explain disk scheduling algorithms-scan, SCAN o Go from the outside to...

SCAN o Go from the outside to the inside servicing requests and after that back from the outside to the inside servicing requests. o Replicate this over and over. o Diminish

Memory organization and decoding, In a  p system each part (RAM, ROM, I/O) ...

In a  p system each part (RAM, ROM, I/O) has a unique set of numbers. The allocation of these numbers is usually stated in the form of a memory map. This is a plot of data bus agai

Parent process: why not finishing and how to make finish, #include #inclu...

#include #include #include #include #include int main(void) { int pchan[2], pid, rval, cvar; char buf[20]; if (pipe(pchan) == -1){

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