Sciweavers

488 search results - page 77 / 98
» Unbounded Transactional Memory
Sort
View
231
Voted
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
16 years 3 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon
142
Voted
PPOPP
2012
ACM
13 years 11 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
117
Voted
IISWC
2008
IEEE
15 years 10 months ago
Temporal streams in commercial server applications
Commercial server applications remain memory bound on modern multiprocessor systems because of their large data footprints, frequent sharing, complex non-strided access patterns, ...
Thomas F. Wenisch, Michael Ferdman, Anastasia Aila...
150
Voted
ICDM
2005
IEEE
166views Data Mining» more  ICDM 2005»
15 years 9 months ago
Sequential Pattern Mining in Multiple Streams
In this paper, we deal with mining sequential patterns in multiple data streams. Building on a state-of-the-art sequential pattern mining algorithm PrefixSpan for mining transact...
Gong Chen, Xindong Wu, Xingquan Zhu
124
Voted
IPPS
2000
IEEE
15 years 7 months ago
Reducing Ownership Overhead for Load-Store Sequences in Cache-Coherent Multiprocessors
Parallel programs that modify shared data in a cachecoherent multiprocessor with a write-invalidate coherence protocol create ownership overhead in the form of ownership acquisiti...
Jim Nilsson, Fredrik Dahlgren