Explain the differences between logical and physical address, Computer Engineering

Assignment Help:

Explain the differences between Logical and physical address space

Logical Vs physical address space

(1) An address produced by the CPU is commonly referred to like a logical a logical address. The set of all logical addresses generated through a program is termed as logical address space. While, an address seen by the memory unit- which is, the one loaded in the memory-address register of the memory- is usually referred to as physical address. The set of all physical addresses consequent to the logical addresses is termed as physical address space.

(2) The methods of compile-time and load-time address-binding produce identical logical and physical addresses. Nevertheless, in the execution-time address-binding scheme and the logical and physical-address spaces are differing.

(3) The user program never considers the physical addresses. The program create a pointer to a logical address, as 346, stores this in memory, manipulate this, compares this to other logical addresses- all as the number 346.

Only while a logical address is used as memory address, this is relocated relative to the relocation or base register. The memory-mapping hardware device termed as the memory- management unit (MMU) converts logical addresses in physical addresses.

(4) Logical addresses range from 0 to max. User program which generates logical address thinks which the process runs in locations 0 to max.

Logical addresses must be mapped into physical addresses before they are utilized.

Physical addresses range from (R+0) to (R + max) for a relocation register or base value R.

(5) Example:

1734_Logical and physical address space.png

 

Mapping from logical to physical addresses by using memory management unit (MMU) and relocation or base register

The value into relocation/base register is added to all logical address generated through a user process, at the time this is sent to memory, to produce corresponding physical address.

In the above diagram, base/ relocation value is 14000 then an attempt through the user to access the location 346 should map to 14346.


Related Discussions:- Explain the differences between logical and physical address

How call processing takes place, How call processing takes place? Fund...

How call processing takes place? Fundamental Call Procedure: Fig. demonstrates a simplification diagram exemplifying how two telephone sets (as subscribers) are interconnecte

Explain time slot interchange, Discuss the basic structure and principle of...

Discuss the basic structure and principle of operation of Time Slot Interchange (TSI) switch with the help of a neat diagram. Principle of time slot interchange  Time

DFD, Define software architecture and describe which types of architectures...

Define software architecture and describe which types of architectures can be used in Email or Facebook applications

Organization structure, organization stucture of vardhman and oswal mills.c...

organization stucture of vardhman and oswal mills.compare and contrast them

What is open addressing, Open addressing:  The easiest way to resolve a co...

Open addressing:  The easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty location. The idea is to place the

Explain loop-invariant code motion, Explain briefly Loop-invariant code ...

Explain briefly Loop-invariant code motion of the commonly used code optimization techniques. Loop-invariant code motion If a quantity is calculated inside a loop duri

Illustrate the state diagrams of dynamic modelling, Dynamic modelling: stat...

Dynamic modelling: state diagrams A state diagrams allow you to further explore operations and attributes which need to be defined for an object. They comprises of sets of sta

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

Two parallel fetch-implement, Take a CPU that shows two parallel fetch-impl...

Take a CPU that shows two parallel fetch-implement pipelines for superscalar processing. Determine the performance improvement over scalar pipeline processing and no-pipeline proce

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