relative address

In this context an offset is sometimes called a relative address.

The second column is the relative address, in hex, of where the code will be placed in memory.

But a program can also use relative address which specifies a location in relation to somewhere else (the base address).

Sometimes there is an overall key index, and pointers to the relative addresses of the particular key indexes are required to be searched.

Usually it refers to a relative address, the location of the next record when compared to the address of the record being presently processed.

Pre-Sixth Edition Unix versions read an executable file into memory and jumped to the first low memory address of the program, relative address zero.

The portion of memory to which an executing program has access is controlled by the RA (Relative Address) and FL (Field Length) registers which are not accessible to the user program.

This address could be an actual physical address, that is, the disk cylinder, track and block number where the data is held, or some sort of relative address: relative, that is, to the beginning of the file.

An address constant can be one, two, three or four bytes long, although an adcon of less than four bytes is conventionally used to hold expression for a small integer such as a length, a relative address, or an index value, and does not represent an address at all.

This of course is not possible for distributed systems since an (absolute) address - in the callers address space - is normally meaningless to the remote program (however, a relative address might in fact be usable if the callee had an exact copy of, at least some of, the caller's memory in advance).