Sciweavers

271 search results - page 28 / 55
» Software transactional memory for dynamic-sized data structu...
Sort
View
VLDB
2005
ACM
122views Database» more  VLDB 2005»
14 years 2 months ago
C-Store: A Column-oriented DBMS
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
Michael Stonebraker, Daniel J. Abadi, Adam Batkin,...
ISCA
2012
IEEE
243views Hardware» more  ISCA 2012»
11 years 11 months ago
BlockChop: Dynamic squash elimination for hybrid processor architecture
Hybrid processors are HW/SW co-designed processors that leverage blocked-execution, the execution of regions of instructions as atomic blocks, to facilitate aggressive speculative...
Jason Mars, Naveen Kumar
GLOBECOM
2008
IEEE
14 years 3 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
ISCA
2002
IEEE
104views Hardware» more  ISCA 2002»
14 years 1 months ago
Using a User-Level Memory Thread for Correlation Prefetching
This paper introduces the idea of using a User-Level Memory Thread (ULMT) for correlation prefetching. In this approach, a user thread runs on a general-purpose processor in main ...
Yan Solihin, Josep Torrellas, Jaejin Lee
ASPLOS
2012
ACM
12 years 4 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...