Skip to search formSkip to main contentSkip to account menu

Flat memory model

Known as: Memory model, Linear address, Linear address space 
Flat memory model or linear memory model refers to a memory addressing paradigm in which "memory appears to the program as a single contiguous… 
Wikipedia (opens in a new tab)

Related topics

Related topics

31 relations
32-bit8-bitAddress spaceAddressing mode

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
SGI® UV2: A fused computation and data analysis machine
UV2 is SGI's second generation data fusion system. UV2 was designed to meet the latest challenges facing users in computation and… 
2010
2010
High-performance memory interface architecture for high-definition video coding application
This paper proposes new memory interface architecture to overcome huge SDRAM bandwidth requirements of video decoders. To improve… 
2010
2010
A 342 mW Mobile Application Processor With Full-HD Multi-Standard Video Codec and Tile-Based Address-Translation Circuits
A full-HD (1080p30) 500 MHz mobile application processor with an H.264 HP/MPEG-2/MPEG-4 video codec is integrated on a 6.4 × 6.5… 
2006
2006
A Storage Scheme for Multi-dimensional Databases Using Extendible Array Files
Large scale scientific datasets are generally modeled as k-dimensional arrays, since this model is amenable to the form of… 
2005
2005
Random and linear address allocation for mobile ad hoc networks
To join an IP network and communicate with others, a node needs to be configured either manually by an administrator or… 
2004
2004
Mondriaan Memory Protection
Reliability and security are quickly becoming users' biggest concern due to the increasing reliance on computers in all areas of… 
2003
2003
Extracting an explicitly data-parallel representation of image-processing programs
Our research goal is to retarget image processingprograms written in sequential languages (e.g., C) toarchitectures with data… 
2002
2002
Exposing data-level parallelism in sequential image processing algorithms
As new computer architectures are developed to exploit large-scale data-level parallelism, techniques are needed to retarget… 
Highly Cited
1991
Highly Cited
1991
Block, Multistride Vector, and FFT Accesses in Parallel Memory Systems
  • D. Harper
  • IEEE Trans. Parallel Distributed Syst.
  • 1991
  • Corpus ID: 11072998
A discussion is presented of the use of dynamic storage schemes to improve parallel memory performance during three important… 
1986
1986
Analysis of an Integrated Token-Passing and CSMA/CD Ring Network in LAN Environment
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)