Sciweavers

36 search results - page 2 / 8
» An implementation and semantics for transactional memory int...
Sort
View
POPL
2009
ACM
13 years 11 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
FLOPS
2006
Springer
13 years 8 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...
HASKELL
2005
ACM
13 years 10 months ago
Haskell on a shared-memory multiprocessor
Multi-core processors are coming, and we need ways to program them. The combination of purely-functional programming and explicit, monadic threads, communicating using transaction...
Tim Harris, Simon Marlow, Simon L. Peyton Jones
CAL
2006
13 years 5 months ago
Subtleties of Transactional Memory Atomicity Semantics
Abstract-- Transactional memory has great potential for simplifying multithreaded programming by allowing programmers to specify regions of the program that must appear to execute ...
Milo M. K. Martin, Colin Blundell, E. Lewis
CC
2009
Springer
132views System Software» more  CC 2009»
14 years 5 months ago
Implementation and Use of Transactional Memory with Dynamic Separation
Abstract. We introduce the design and implementation of dynamic separation (DS) as a programming discipline for using transactional memory. Our approach is based on the programmer ...
Andrew Birrell, Johnson Hsieh, Martín Abadi...