Sciweavers

3202 search results - page 110 / 641
» Memory access scheduling
Sort
View
MSS
2000
IEEE
81views Hardware» more  MSS 2000»
15 years 8 months ago
Compact Holographic Read/Write Memory
— We examine the primary challenges for building a practical and competitive holographic random access memory (HRAM) system, specifically size, speed, and cost. We show that a fa...
Wenhai Liu, Demetri Psaltis
ASPLOS
2012
ACM
14 years 6 days ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...
CDC
2008
IEEE
187views Control Systems» more  CDC 2008»
15 years 11 months ago
Controlled random access MAC for network utility maximization in wireless networks
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
Robert J. McCabe, Nikolaos M. Freris, P. R. Kumar
CACM
2008
100views more  CACM 2008»
15 years 4 months ago
TxLinux and MetaTM: transactional memory and the operating system
TxLinux is the first operating system to use hardware transactional memory (HTM) as a synchronization primitive, and the first to manage HTM in the scheduler. TxLinux, which is a ...
Christopher J. Rossbach, Hany E. Ramadan, Owen S. ...
IEEEHPCS
2010
15 years 2 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...