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

Internet programming, Futoshiki is a game played on an N by N (usually 5 by...

Futoshiki is a game played on an N by N (usually 5 by 5) grid and uses the symbols 1 .. N. The objective of the game is to place each symbol on the grid so that it only occurs once

Implementing protection with virtual memory, Implementing Protection with V...

Implementing Protection with Virtual Memory - computer architecture: To enable the operating system to implement protection in the VM system, the HW have to: I. Support at

Show the mailing lists on internet, Q. Show the Mailing lists on Internet? ...

Q. Show the Mailing lists on Internet? Another exciting aspect about E-mail is that you can find groups of people who share your interests-whether you are inclined toward games

An example subroutine call, Create your own Subprogram that does *not* use ...

Create your own Subprogram that does *not* use any input parameters. You decide the theme. You should give the pseudocode and an example Subroutine call. Be sure to give an overvie

What is called static and dynamic branch prediction, What is called static ...

What is called static and dynamic branch prediction? The branch prediction decision is always the similar every time a given instruction is implemented. Any approach that has t

Html 4.0 element, , an HTML 4.0 element supported by Netscape6 and MSIE, de...

, an HTML 4.0 element supported by Netscape6 and MSIE, defines a set of text which is associated with a specific form element. For illustration, code belo

Minimum total number of shelv, Write a program that finds the minimum total...

Write a program that finds the minimum total number of shelv, C/C++ Programming

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

EDC, Conparision of masfet and jfet

Conparision of masfet and jfet

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