A preliminary assessment of Haskell's software transactional memory constructs

Authors:
Fernando Castor;Francisco Soares-Neto;André L. M. Santos
Affiliations:
Federal Univ. of Pernambuco, Recife, Brazil;Federal Univ. of Pernambuco, Recife, Brazil;Federal Univ. of Pernambuco, Recife, Brazil
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 5
Cited 0

Atomic quake: using transactional memory in an interactive multiplayer game server

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Is transactional programming actually easier?

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Real Java applications in software transactional memory

IISWC '10 Proceedings of the IEEE International Symposium on Workload Characterization (IISWC'10)
A study of transactional memory vs. locks in practice

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Software transactional memory vs. locking in a functional language: a controlled experiment

Proceedings of the compilation of the co-located workshops on DSM'11, TMC'11, AGERE!'11, AOOPES'11, NEAT'11, & VMIL'11

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, usage of multicore architectures has boosted the need for concurrency. Many researchers have pointed out Software Transactional Memory (STM) as an easy way to achieve it. This study presents a preliminary evaluation of Haskell's STM constructs against its lock-based alternative. Subjects which used STM committed significantly fewer mistakes and required on average 12% less time to finish their assignments.