Sciweavers

3202 search results - page 206 / 641
» Memory access scheduling
Sort
View
SOSP
2009
ACM
16 years 3 months ago
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based interface. However, new byte-addressable, persistent memo...
Jeremy Condit, Edmund B. Nightingale, Christopher ...
CASES
2006
ACM
16 years 2 days ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
ISCA
1996
IEEE
126views Hardware» more  ISCA 1996»
15 years 10 months ago
Memory Bandwidth Limitations of Future Microprocessors
This paper makes the case that pin bandwidth will be a critical consideration for future microprocessors. We show that many of the techniques used to tolerate growing memory laten...
Doug Burger, James R. Goodman, Alain Kägi
IPPS
2005
IEEE
15 years 11 months ago
Fast Address Translation Techniques for Distributed Shared Memory Compilers
The Distributed Shared Memory (DSM) model is designed to leverage the ease of programming of the shared memory paradigm, while enabling the highperformance by expressing locality ...
François Cantonnet, Tarek A. El-Ghazawi, Pa...
CCGRID
2010
IEEE
15 years 7 months ago
Region-Based Prefetch Techniques for Software Distributed Shared Memory Systems
Although shared memory programming models show good programmability compared to message passing programming models, their implementation by page-based software distributed shared m...
Jie Cai, Peter E. Strazdins, Alistair P. Rendell