Sciweavers

1147 search results - page 113 / 230
» Virtualizing Transactional Memory
Sort
View
PDP
2006
IEEE
15 years 7 months ago
Comparing Commodity SMP System Software with a Matrix Multiplication Benchmark
Commodity symmetric multiprocessors (SMPs), though originally intended for transaction processing, because of their availability, are now used for numerical analysis applications ...
Georgios Tsilikas, Martin Fleury
FLOPS
2006
Springer
15 years 5 months ago
Lock Free Data Structures Using STM in Haskell
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...
Anthony Discolo, Tim Harris, Simon Marlow, Simon L...
FIMI
2003
123views Data Mining» more  FIMI 2003»
15 years 3 months ago
Apriori, A Depth First Implementation
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...
Walter A. Kosters, Wim Pijls
IDA
2007
Springer
15 years 1 months ago
Approximate mining of frequent patterns on streams
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...
Claudio Silvestri, Salvatore Orlando
VEE
2009
ACM
146views Virtualization» more  VEE 2009»
15 years 8 months ago
Achieving 10 Gb/s using safe and transparent network interface virtualization
: © Achieving 10 Gb/s using Safe and Transparent Network Interface Virtualization Kaushik Kumar Ram, Jose Renato Santos, Yoshio Turner, Alan L. Cox, Scott Rixner HP Laboratories H...
Kaushik Kumar Ram, Jose Renato Santos, Yoshio Turn...