Explain relative addressing scheme, Computer Engineering

Assignment Help:

Q. Explain Relative Addressing Scheme?

In this addressing technique the register R is the program counter (PC) which contains the address of current instruction being executed. Operand field A comprises the displacement (negative orpositive) of adata or instruction with respect to current instruction. This addressing scheme has benefits if memory references are nearer to current instruction being executed. (Please refer to the Figure below). 

896_Explain Relative Addressing Scheme.png

Let's give an illustration of Index, Base and Relative addressing techniques. 

Illustration 1: What would be the effective address and operand value for following LOAD instructions?

(i)    LOAD   IA   56 R1 Where IA signifies index addressing and R1 is index register and 56 is the displacement in Hexadecimal.

(ii)   LOAD BA 46 B1 Where BA signifies base addressing and B1 is base register and46 is the displacement specified in instruction in Hexadecimal notation.

(iii)  LOAD RA 36 Where RA signifies relative addressing. 

 The values of memory and registers is given below:

1500_Explain Relative Addressing Scheme1.png

The values are displayed in the below table:

597_Explain Relative Addressing Scheme2.png


Related Discussions:- Explain relative addressing scheme

Path & Path Production, Take the following flow graph and use the procedure...

Take the following flow graph and use the procedure in chapter 8 to derive an equivalent regular expression. Show all intermediate graphs (to ensure that you follow the procedure,

DoDAF OV-2 for a green datacenter, How do I create a DoDAF OV-2 for the con...

How do I create a DoDAF OV-2 for the construction of a green data center?

Drawback of the system using disk caching, Q. Drawback of the system using ...

Q. Drawback of the system using disk caching? The main drawback of the system using disk caching is risking loss of updated information in event of machine failures like loss o

Graph has a minimum spanning tree already computed, Assume that a graph has...

Assume that a graph has a minimum spanning tree already computed.  How fastly can the minimum spanning tree be updated if a new vertex and incident edges are added to G? If the

Enginering mechanics, if 2 forces are equal at an angle alpha between them...

if 2 forces are equal at an angle alpha between them - its resultant R and its direction

Compiler software difficulty, IA-64 instead depends on the compiler for thi...

IA-64 instead depends on the compiler for this task. Even before the program is fed into the CPU, the compiler studies the code and makes the similar sorts of decisions that would

Observed speedup and parallel overhead, Observed Speedup Observed speed...

Observed Speedup Observed speedup of a system which has been parallelized, is defined as:                             Granularity is one of the easiest and most extensi

Discuss the process of data mining, Discuss the process of data mining? ...

Discuss the process of data mining? The process of data mining having of three stages: (1)The initial exploration (2) Model building or pattern identification with validat

Explain working of intranet, Intranets are mainly "small" Internets. They u...

Intranets are mainly "small" Internets. They use same network facilities that Internet does, though access is restricted to a limited sphere. For example, a company can set up an i

Define the advantages of assembly language., Highlight the advantages of as...

Highlight the advantages of assembly language. The benefits of assembly language program would be Reduced errors Faster translation times Changes could be made fas

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