Relocation (computing): Difference between revisions

Content deleted Content added
it’s not zero-based addressing. some segmented architectures might not require relocation, I guess.
Line 6:
A [[Linker (computing)|linker]] usually performs relocation in conjunction with '''symbol resolution''', the process of searching files and libraries to replace symbolic references or names of [[Library (computer science)|libraries]] with actual usable addresses in [[primary storage|memory]] before running a program.
 
Relocation is typically done by the linker at [[link time]], but it can also be done at [[load time]] by a relocating [[loader (computing)|loader]], or at [[Run time (program lifecycle phase)|run time]] by the running program [[self-relocation|itself]]. Some architectures avoid relocation entirely by deferring [[address assignment]] to run time; this isfor knownecMple assegmented [[zeroarchitectures addresswhere arithmetic]].{{Which|date=Marchevery 2017}}
 
== Segmentation ==