Sciweavers

1053 search results - page 114 / 211
» Shape as Memory Storage
Sort
View
CACM
2011
113views more  CACM 2011»
14 years 1 months ago
The case for RAMCloud
Disk-oriented approaches to online storage are becoming increasingly problematic: they do not scale gracefully to meet the needs of large-scale Web applications, and improvements ...
John K. Ousterhout, Parag Agrawal, David Erickson,...
ASPLOS
2009
ACM
15 years 10 months ago
Phantom-BTB: a virtualized branch target buffer design
Modern processors use branch target buffers (BTBs) to predict the target address of branches such that they can fetch ahead in the instruction stream increasing concurrency and pe...
Ioana Burcea, Andreas Moshovos
KES
2007
Springer
14 years 9 months ago
KeyGraph-based chance discovery for mobile contents management system
Chance discovery provides a way to find rare but very important events for future decision making. It can be applied to stock market prediction, earthquake alarm, intrusion detect...
Kyung-Joong Kim, Myung-Chul Jung, Sung-Bae Cho
VLSISP
2002
112views more  VLSISP 2002»
14 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
APLAS
2009
ACM
15 years 4 months ago
Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...
Rupesh Nasre, Kaushik Rajan, Ramaswamy Govindaraja...