Explain the differences between paging and segmentation, Computer Engineering

Assignment Help:

Explain the differences between Paging and segmentation.

Paging and segmentation

Paging

Segmentation

Computer memory is separated into small partitions which are all similar size and considered to as, page frames. Then while a process is loaded this gets divided in pages that are similar size as those earlier frames. The process pages are after that loaded in the frames.

Memory-management scheme which supports user vision of memory.

Computer memory is allocated in different sizes (as segments) depending upon the required for address space through the process.

Address generated through CPU is divided into:

Page number (p) - It used like an index in a page table that contains base address of each page into physical memory.

Page offset (d) - It combined with base address to describe the physical memory address which is sent to the

memory unit.

Logical address contains a two tuple:

< segment-number, offset >

Transparent to programmer (i.e. system

allocates memory)

Includes programmer (i.e. allocates memory to

specific function inside code)

No separate- the protection

To separate the protection

No separate- the compiling

To separate the compiling

No shared-the code

To share the code


Related Discussions:- Explain the differences between paging and segmentation

Determine resources, Consider the following system snapshot using data stru...

Consider the following system snapshot using data structures in the Banker's algorithm, with resources A, B, C, and D, and process P0 to P4:                           Max

Layered architecture.., advantages and disadvantages of layered architectur...

advantages and disadvantages of layered architecture in computer network.

What is a work process, What is a work process? A work process is where ...

What is a work process? A work process is where individual dialog steps are in fact processed and the work is done.  Every work process ocuurs one type of request.

..binary tree, draw a binary tree from its inorder and preorder traversal s...

draw a binary tree from its inorder and preorder traversal sequences given as follows: inorder: d b g e h a c n f preorder: a b d e g h c f n

Essential features of an algorithm, Necessary features of an algorithm: ...

Necessary features of an algorithm: 1.Input: The algorithm should take zero or more input. 2. Output: The algorithm should generate one or more outputs.  3. Definiteness:

Enumerate in brief about the intranet security policy, Enumerate in brief a...

Enumerate in brief about the Intranet security policy An Intranet security policy is a very broad topic and it cannot be covered easily in few pages since it differs from situa

Explain complete binary tree, Complete Binary tree A complete binary tr...

Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level

Provide constructors, For this assignment, fill out the following class:   ...

For this assignment, fill out the following class:   class person { private:   string firstName;   string lastName;   int weight; public:   . . . }; You should provide cons

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