Sciweavers

16 search results - page 1 / 4
» Lock Free Data Structures Using STM in Haskell
Sort
View
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...
EUROSYS
2007
ACM
14 years 1 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
ICDE
2001
IEEE
129views Database» more  ICDE 2001»
14 years 6 months ago
High-Performance, Space-Efficient, Automated Object Locking
The paper studies the impact of several lock manager designs on the overhead imposed to a persistent programming language by automated object locking. Our study reveals that a loc...
Grzegorz Czajkowski, Laurent Daynès
MICRO
2010
IEEE
242views Hardware» more  MICRO 2010»
13 years 2 months ago
ASF: AMD64 Extension for Lock-Free Data Structures and Transactional Memory
Advanced Synchronization Facility (ASF) is an AMD64 hardware extension for lock-free data structures and transactional memory. It provides a speculative region that atomically exec...
Jae-Woong Chung, Luke Yen, Stephan Diestelhorst, M...
PLDI
2009
ACM
13 years 11 months ago
Stretching transactional memory
Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are like...
Aleksandar Dragojevic, Rachid Guerraoui, Michal Ka...