Difference between relocatable and self relocatable programs, Computer Engineering

Assignment Help:

Difference between relocatable and self relocatable programs.

A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustration an object module. The difference among a relocatable and a non-relocatable program is the availability of information relating to the address sensitive instructions in this. A self-relocating program is the one which can perform the relocation of its own address sensitive instructions.

A self-relocating program can execute into any area of memory. It is very significant in time-sharing operating system where load address of a program is likely to be different for various executions.


Related Discussions:- Difference between relocatable and self relocatable programs

Levels of parallel processing, Levels Of Parallel Processing Depending ...

Levels Of Parallel Processing Depending upon the difficulty under consideration, parallelism in the answer of the problem may be achieved at dissimilar levels and in different

What is the basic workflow order for color match, Question: (a) What is...

Question: (a) What is the difference between the Color Pass and the Color Replace effects? (b) What is the basic workflow order for Color Match? (c) Explain clearly the

Advantages of instruction set architecture, Advantages of Instruction set a...

Advantages of Instruction set architecture: Stack Advantages : it is simple Model of expression evaluation (reverse polish). Contain Short instructions. Disadvanta

Restore the system defaults, In order to restore the system defaults for al...

In order to restore the system defaults for all changes made with the format statement is Format Reset

The color and plot style, Write a script that will make x and y vectors.  T...

Write a script that will make x and y vectors.  Then, it will ask the user for a color ('red', 'blue', or 'green') and for a plot style ('o', '*').  It will then make a string "pst

How address resolution is performed with table lookup, How address resoluti...

How address resolution is performed with table lookup? Explain with the help of a suitable example. The approach of table lookup to address resolution needs a data structure wh

Explain the process of inter-register signalling, Explain the process of in...

Explain the process of inter-register signalling. Registers are utilized in common control exchanges to store and analyze routing data. They are given on a common basis is a

Define memory cell, Define memory cell? A memory cell is capable of sto...

Define memory cell? A memory cell is capable of storing single bit of information. It is usually organized in the form of an array

Illustrate the multiplication algorithms, Multiplication Algorithms Mul...

Multiplication Algorithms Multiplication of the two fixed-point binary numbers in signed magnitude representation is done with paper and pencil through a process of successive

Search mechanisms in prolog, Search mechanisms in Prolog: Here we can ...

Search mechanisms in Prolog: Here we can needs this simple Prolog program to describe how Prolog searches as:president(X) :- first_name(X, georgedubya), second_name(X, bush).

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