Sciweavers

2186 search results - page 130 / 438
» Considering an Organization's Memory
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Event classification for personal photo collections
People take more and more photos at different time and different events, however, these photos are often put into one giant folder and they are seldom annotated or organized. As t...
Feng Tang, Daniel Tretter, Chris Willis
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
15 years 8 months ago
Translation caching: skip, don't walk (the page table)
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...
Thomas W. Barr, Alan L. Cox, Scott Rixner
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 6 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
DAC
2008
ACM
16 years 7 months ago
Miss reduction in embedded processors through dynamic, power-friendly cache design
Today, embedded processors are expected to be able to run complex, algorithm-heavy applications that were originally designed and coded for general-purpose processors. As a result...
Garo Bournoutian, Alex Orailoglu
IWMM
2009
Springer
130views Hardware» more  IWMM 2009»
16 years 1 months ago
A component model of spatial locality
Good spatial locality alleviates both the latency and bandwidth problem of memory by boosting the effect of prefetching and improving the utilization of cache. However, convention...
Xiaoming Gu, Ian Christopher, Tongxin Bai, Chengli...