What is segmentation?, Operating System

SEGMENTATION

In a memory management system that is properly 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 generally contains of s set of procedures or data and forms a module of a few software systems.

The motivation for segmentation is to group together data and procedures that possess common attributes for sharing by other procedures. This is beneficial for implementing protection in a large software system. The user thus specifies each address by two quantities: an offset and a segment name. For the simplicity of execution segments are numbered and are referred to by a segment number.

 

Posted Date: 6/24/2013 6:35:56 AM | Location : United States







Related Discussions:- What is segmentation?, Assignment Help, Ask Question on What is segmentation?, Get Answer, Expert's Help, What is segmentation? Discussions

Write discussion on What is segmentation?
Your posts are moderated
Related Questions
socket based fortune teller sever.your program should create a server that listens to a specific port when a client receives a connection the server should respond with a random fo

What are the various page replacement algorithms used for page replacement? FIFO page replacement Optimal page replacement LRU page replacement LRU approximat

Define multithreading The proficiency of an operating system to execute different parts of a program called threads simultaneously is called as multithreading. A thread is a fl

Problem: (a) Discuss Distributed File System Caching. (Your discussion should include the goal and architecture of distributed file system caching and the various possible c

Define an assembly language  Assembly language stands for a Low level programming language

What is starvation? A main problem related to deadlock is starvation. Starvation is the circumstances where process waits indefinitely within the semaphore. Indefinite blocking

Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are

how do semaphores help us in eliminating deadlock conditions?

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa. Answer: A schedule that is auth

FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit