Rodrigo Medeiros Duarte

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
An algorithm which explores performance on concurrent hash tables is far from being a non-trivial computation task. This paper presents seven hash table Haskell implementations, which include low level synchronism models to high level ones such as transactional memories. The result of the comparison between the algorithms showed that the implementation(More)
Transactional Memory is a concurrent programming abstraction that overcomes several of the limitations found in traditional synchronization mechanisms. As it is a more recent abstraction, little is known about energy consumption of Software Transactional Memories (STM). In this context, this work presents an analysis and characterization of energy(More)
STM Haskell extends the Haskell functional programming language with a set of primitives for writing composable memory transactions. STM Haskell employs lazy version management and lazy conflict detection algorithms. This paper describes a new implementation of STM Haskell, completely implemented in Haskell, the LSTM. Different of all previous(More)
This paper describes a high level implementation of Software Transactional Memory (STM) for the Haskell language. The library is implemented completely in Haskell and, as opposed to all other implementation of STM Haskell, it features early detection of write/write conflicts. Preliminary performance measurements using the Haskell STM benchmark show that the(More)
  • 1