Difference between non-relocatable self relocatable programs, Computer Engineering

Assignment Help:

Differentiate between non-relocatable self 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 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 non-relocatable self relocatable programs

Group cells in a layout table, Now you will put navigation button cells you...

Now you will put navigation button cells you just created into a single table. Grouping cells into a table enables you to control cell spacing and to easily move the cells as a gro

Describe big notation, Q. Describe Big Notation? Big O Notation : The ...

Q. Describe Big Notation? Big O Notation : The set O (g(n)) comprises all functions f(n) for that there exists   positive constants c such that for satisfactorily large values

Eliminating hazards - computer architecture, Eliminating hazards of pipeli...

Eliminating hazards of pipeline -  computer architecture: We can delegate the work of eliminating data dependencies to the compiler, which can fill up in suitable number of NO

Explain the term - integrity, Explain the term - Integrity In most c...

Explain the term - Integrity In most cases, corporate data should remain unchanged by third parties, so the system should be capable of ensuring that only authorised personn

Example of unification, Example of Unification: Let now here, assume i...

Example of Unification: Let now here, assume instead that we had these two sentences as:  knows(john,X) → hates(john, X)  knows(jack, mary)  Thus here the predicate n

is risc always fast, It is fast because it has got separate program and da...

It is fast because it has got separate program and data memory(highly pipelined architecture)

Exdplain instruction buffers, Instruction buffers For taking the comple...

Instruction buffers For taking the complete advantage of pipelining pipelines must be filled continuously. So instruction fetch rate must be matched with pipeline consumption r

What is replacement algorithm, What is replacement algorithm? When the ...

What is replacement algorithm? When the cache is full and a memory word that is not in the cache is referenced, the cache control hardware must decide which block should be del

Concepts of an address and data, The heart of a computer is often one integ...

The heart of a computer is often one integrated circuit; one typical circuit is a 68Hc11 Microprocessor. Let us consider a typical 68Hc11 hardware design.           The mic

Define the resolution of externally defined symbols, Resolution of external...

Resolution of externally defined symbols is performed by Ans. By Linker resolution of externally defined symbols is performed.

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