Sciweavers

195 search results - page 35 / 39
» On the energy-efficiency of software transactional memory
Sort
View
POPL
2009
ACM
15 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
93
Voted
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
15 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
100
Voted
AFP
2008
Springer
236views Formal Methods» more  AFP 2008»
15 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
FASE
2009
Springer
15 years 4 months ago
Logical Testing
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
Kathryn E. Gray, Alan Mycroft
ASPLOS
2012
ACM
13 years 5 months ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...