Sciweavers

5410 search results - page 976 / 1082
» When to Cross Over
Sort
View
130
Voted
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
15 years 5 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
105
Voted
SIGMOD
2010
ACM
231views Database» more  SIGMOD 2010»
15 years 5 months ago
Automatically incorporating new sources in keyword search-based data integration
Scientific data offers some of the most interesting challenges in data integration today. Scientific fields evolve rapidly and accumulate masses of observational and experiment...
Partha Pratim Talukdar, Zachary G. Ives, Fernando ...
132
Voted
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
15 years 5 months ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden
117
Voted
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
15 years 5 months ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi
SPAA
2010
ACM
15 years 5 months ago
TLRW: return of the read-write lock
TL2 and similar STM algorithms deliver high scalability based on write-locking and invisible readers. In fact, no modern STM design locks to read along its common execution path b...
David Dice, Nir Shavit