Difference b/w non-relocatable and relocatable programs, Computer Engineering

Assignment Help:

Differentiate between non-relocatable and relocatable programs.

A non-relocatable program is one which cannot be executed in any memory area other than the area starting at its translated origin. For illustration a hand coded machine language program.

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.


Related Discussions:- Difference b/w non-relocatable and relocatable programs

What is drive, Any data storage device. This having of  your CD-ROM drive, ...

Any data storage device. This having of  your CD-ROM drive, hard disk drive and floppy disk drive.

Illustrate code segment with example, CODE SEGMENT ; Set DS register ...

CODE SEGMENT ; Set DS register MOV AX, DATA     ;    boiler plate code to set the DS register so that the MOV DS, AX          ;    program can access the data segment.

Heuristic search strategies, Heuristic Search Strategies: Generally sp...

Heuristic Search Strategies: Generally speaking that, a heuristic search is one which have uses a rule of thumb to improve an agent's performance in solving the problems via s

What are interrupts, What are interrupts?  Interrupt: An interrupt i...

What are interrupts?  Interrupt: An interrupt is a hardware mechanism which enables an external device, classically input/output devices, to send a signal to the CPU. An int

Address translation - computer architecture, Address translation: ...

Address translation: Compiler time : If it is known in advance that a program will reside at a particular location of primary memory, and then the compiler can be told to

Define mapping and list mapping procedure, Define Mapping and List  mappin...

Define Mapping and List  mapping procedure? The transformation of data from main memory to cache memory is known as an Mapping. Associative mapping Direct mapping

Duplicating processes, DUPLICATING PROCESSES : As we mentioned earlier dup...

DUPLICATING PROCESSES : As we mentioned earlier duplicating is a process whereby a master copy is prepared from which a large number of other copies are obtained with the help of

Analysis of amdahls law, Q. Analysis of Amdahls law? The conclusions of...

Q. Analysis of Amdahls law? The conclusions of analysis of Amdahl's law are: 1) To optimize performance of parallel computers modified compilers should be developed that sho

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