This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Flat memory model" – news ·newspapers ·books ·scholar ·JSTOR(December 2009) (Learn how and when to remove this message)

Flat memory model orlinear memory model refers to amemory addressing paradigm in which "memory appears to the program as a single contiguousaddress space."^[1] TheCPU can directly (andlinearly)address all of the availablememory locations without having to resort to any sort ofbank switching,memory segmentation orpaging schemes.

Memory management andaddress translation can still be implementedon top of a flat memory model in order to facilitate theoperating 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 asingle 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.

This sectionis inlist format but may read better asprose. You can help byconverting this section, if appropriate.Editing help is available.(August 2018)

Most modern memory models fall into one of three categories:

• Simple interface for programmers, clean design
• Greatest flexibility due to uniform access speed (segmented memory page switches usually incur varied latency due to longer accesses of other pages, either due to extra CPU logic in changing page, or hardware requirements)
• Minimum hardware and CPU real estate for simple controller applications^{[clarification needed]}
• Maximum execution speed, as there is no need to access auxiliary data structures such as a segment or page table inRAM
• Not suitable for general computing or multitasking operating systems

• Suitable for multitasking, general operating system design, resource protection and allocation
• Suitable for virtual memory implementation
• More CPU real estate, somewhat lower speed
• More complex to program
• Rigid page boundaries, not always the most memory efficient
• This memory model is required when usingPhysical Address Extension (PAE) inPentium Pro and later x86 CPUs to support 36-bit physical addresses to address more than 4GB of physical memory.

• Similar to paged memory, but paging is achieved by the implicit addition of two relatively shifted registers:segment:offset
• Variable page boundaries, more efficient and flexible than the paged memory model
• Quite complex and awkward from a programmer's point of view
• More difficult for compilers
• Pages can overlap / poor resource protection and isolation
• Many to one address translation correspondence: Manysegment:offset combinations resolve to the same physical address
• Greater chance of programming errors
• Implemented in the original Intel 8086,8088,80186,80286, and supported by80386 and all subsequentx86 machines through to present dayPentium andCore 2 processors. This memory model has remained ever since in the x86 machines, which now provide multi-mode operation and rarely operate in the compatible segmented mode.^{[clarification needed]} Seex86 memory segmentation for details.
• saves RAM by moving the segment address, this allows short jumps that require fewer bytes.

Within the x86 architectures, when operating in thereal mode (or emulation), physical address is computed as:^[2]

Address = 16 × segment + offset

(I.e., the 16-bit segment register is shifted left by 4 bits and added to a 16-bit offset, resulting in a 20-bit address.)

• Address space
• Memory model (disambiguation)

• Computer memory

• Articles needing additional references from December 2009
• All articles needing additional references
• Articles needing cleanup from August 2018
• All pages needing cleanup
• Articles with sections that need to be turned into prose from August 2018
• Wikipedia articles needing clarification from November 2016
• Wikipedia articles needing clarification from July 2010