Sciweavers

352 search results - page 31 / 71
» Good Programming in Transactional Memory
Sort
View
SIGPLAN
2008
13 years 7 months ago
Single global lock semantics in a weakly atomic STM
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transa...
Vijay Menon, Steven Balensiefer, Tatiana Shpeisman...
CLUSTER
2002
IEEE
14 years 18 days ago
Mixed Mode Matrix Multiplication
In modern clustering environments where the memory hierarchy has many layers (distributed memory, shared memory layer, cache,  ¡ ¢  ), an important question is how to fully u...
Meng-Shiou Wu, Srinivas Aluru, Ricky A. Kendall
ISCA
2002
IEEE
68views Hardware» more  ISCA 2002»
14 years 17 days ago
Timekeeping in the Memory System: Predicting and Optimizing Memory Behavior
Techniques for analyzing and improving memory referencing behavior continue to be important for achieving good overall program performance due to the ever-increasing performance g...
Zhigang Hu, Margaret Martonosi, Stefanos Kaxiras
AFP
2008
Springer
236views Formal Methods» more  AFP 2008»
14 years 2 months ago
A Tutorial on Parallel and Concurrent Programming in Haskell
This practical tutorial introduces the features available in Haskell for writing parallel and concurrent programs. We first describe how to write semi-explicit parallel programs b...
Simon L. Peyton Jones, Satnam Singh
IDA
2007
Springer
13 years 7 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