Sciweavers

1080 search results - page 206 / 216
» Distributed Hash Tables
Sort
View
95
Voted
HPCA
2008
IEEE
16 years 2 months ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...
100
Voted
HPCA
2003
IEEE
16 years 2 months ago
TCP: Tag Correlating Prefetchers
Although caches for decades have been the backbone of the memory system, the speed gap between CPU and main memory suggests their augmentation with prefetching mechanisms. Recentl...
Zhigang Hu, Margaret Martonosi, Stefanos Kaxiras
115
Voted
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 2 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
194
Voted
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 2 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 2 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo