Sciweavers

2512 search results - page 42 / 503
» Software Transactional Memory
Sort
View
ASPLOS
2008
ACM
13 years 12 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
POPL
2009
ACM
14 years 4 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
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
14 years 4 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir
AFP
2008
Springer
236views Formal Methods» more  AFP 2008»
14 years 4 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
IPPS
2000
IEEE
14 years 2 months ago
Using Logs to Increase Availability in Real-Time Main-Memory Database
Abstract. Real-time main-memory databases are useful in real-time environments. They are often faster and provide more predictable execution of transactions than disk-based databas...
Tiina Niklander, Kimmo E. E. Raatikainen