What is segmentation?, Operating System

Assignment Help:

What is segmentation?

In a segmented memory management scheme a programmer views a program to be collection of program components called as segments. Every segment is a logical unit of a program as defined by the programmer's design. In programming terms a segment typically contains of s set of procedures or data and forms a module of some software system. The inspiration for segmentation is to group together procedures and data which possess common attributes for sharing by other procedures. This is beneficial for implementing protection in a large software system. The user therefore specifies every address by two quantities that are a segment name and an offset. For the ease of implementation 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:

                                      

 


Related Discussions:- What is segmentation?

Macro, What is macro expansion

What is macro expansion

What are the typical elements of a process image, What are the typical elem...

What are the typical elements of a process image? User data: Modifiable part of user space. May have program data, user stack area, and programs that might be modified. User

Assembly, Write a program that will input two numbers from the keyboard and...

Write a program that will input two numbers from the keyboard and execute each of the signed and unsigned multiply and divide instructions. For each instruction, the program shoul

Determine the scheduling technique, The scheduling technique in which CPU i...

The scheduling technique in which CPU is allocated to the process with least CPU-burst time is known as  Shortest job first Scheduling is a scheduling technique in which CPU i

CPU Scheduing FCFS, Assume that P A , P B and P C are three distinguished p...

Assume that P A , P B and P C are three distinguished program s . When P A is executed, it needs 10 ticks to complete its execution and it forks new processes executing P B at tick

Bankers algorithm, p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 ...

p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 0014

Linux kernel components, Example 1.  The diagram illustrating the data stru...

Example 1.  The diagram illustrating the data structures of in-memory VFS objects and on-disk objects and their relationships on slide 24 of the lecture notes OSD.4. This diagram i

Dynamic scheduling, Dynamic scheduling : The number of thread in a program...

Dynamic scheduling : The number of thread in a program may be changed during the course of operation. Dynamic priority scheduling is a kind of scheduling algorithm in which the pr

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