linear address - définition. Qu'est-ce que linear address
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est linear address - définition

ADDRESSING PARADIGM MODELING MEMORY AS ONE CONTIGUOUS ADDRESS SPACE
Linear address; Linear address space; Linear addressing; Flat address space

linear address space         
A memory addressing scheme used in processors where the whole memory can be accessed using a single address that fits in a single register or instruction. This contrasts with a segmented memory architecture, such as that used on the Intel 8086, where an address is given by an offset from a base address held in one of the "segment registers". Linear addressing greatly simplifies programming at the {assembly language} level but requires more instruction word bits to be allocated for an address. (1995-02-16)
flat address space         
<architecture> The memory architecture in which any memory location can be selected from a single contiguous block by a single integer offset. Almost all popular processors have a flat address space, but the Intel x86 family has a segmented address space. A flat address space greatly simplifies programming because of the simple correspondence between addresses (pointers) and integers. (1996-09-10)
linear map         
  • The function f:\R^2 \to \R^2 with f(x, y) = (2x, y) is a linear map. This function scales the x component of a vector by the factor 2.
  • The function f(x, y) = (2x, y) is additive: It doesn't matter whether vectors are first added and then mapped or whether they are mapped and finally added: f(\mathbf a + \mathbf b) = f(\mathbf a) + f(\mathbf b)
  • The function f(x, y) = (2x, y) is homogeneous: It doesn't matter whether a vector is first scaled and then mapped or first mapped and then scaled: f(\lambda \mathbf a) = \lambda f(\mathbf a)
MAPPING THAT PRESERVES THE OPERATIONS OF ADDITION AND SCALAR MULTIPLICATION
Linear operator; Linear mapping; Linear transformations; Linear operators; Linear transform; Linear maps; Linear isomorphism; Linear isomorphic; Linear Transformation; Linear Transformations; Linear Operator; Homogeneous linear transformation; User:The Uber Ninja/X3; Linear transformation; Bijective linear map; Nonlinear operator; Linear Schrödinger Operator; Vector space homomorphism; Vector space isomorphism; Linear extension of a function; Linear extension (linear algebra); Extend by linearity; Linear endomorphism
<mathematics> (Or "linear transformation") A function from a vector space to a vector space which respects the additive and multiplicative structures of the two: that is, for any two vectors, u, v, in the source vector space and any scalar, k, in the field over which it is a vector space, a linear map f satisfies f(u+kv) = f(u) + kf(v). (1996-09-30)

Wikipédia

Flat memory model

Flat memory model or linear memory model refers to a memory addressing paradigm in which "memory appears to the program as a single contiguous address space." The CPU can directly (and linearly) address all of the available memory locations without having to resort to any sort of memory segmentation or paging schemes.

Memory management and address translation can still be implemented on top of a flat memory model in order to facilitate the operating system's functionality, resource protection, multitasking or to increase the memory capacity beyond the limits imposed by the processor's physical address space, but the key feature of a flat memory model is that the entire memory space is linear, sequential and contiguous.

In a simple controller, or in a single tasking embedded application, where memory management is not needed nor desirable, the flat memory model is the most appropriate, because it provides the simplest interface from the programmer's point of view, with direct access to all memory locations and minimum design complexity.

In a general purpose computer system, which requires multitasking, resource allocation, and protection, the flat memory system must be augmented by some memory management scheme, which is typically implemented through a combination of dedicated hardware (inside or outside the CPU) and software built into the operating system. The flat memory model (at the physical addressing level) still provides the greatest flexibility for implementing this type of memory management.

The majority of processor architectures implement a flat memory design, including all early 8-bit processors, the Motorola 68000 series, etc. One exception was the original 8086, Intel's first 16-bit microprocessor, which implemented a crude segmented memory model which allowed access to more than 64 KiB of memory without the cost of extending all addresses to more than 16-bits.