713 search results - page 93 / 143 » Hybrid transactional memory |
PDP
2006
IEEE
14 years 2 months ago
2006
IEEE
Commodity symmetric multiprocessors (SMPs), though originally intended for transaction processing, because of their availability, are now used for numerical analysis applications ...
FLOPS
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
FIMI
2003
13 years 10 months ago
2003
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
IDA
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
SIGMOD
1995
ACM
14 years 6 days ago
1995
ACM
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines whil...