User-Level Transaction Scheduling in Haskell

• Rodrigo Medeiros Duarte UFPel
• André Rauber Du Bois UFPel
• Gerson Geraldo Homrich Cavalheiro UFPel
• Maurício Lima Pilla UFPel

Resumo

Transactional Memory is an abstraction that helps concurrent programming, however, in high contention sceneries, it presents low performance because of the high conflict rate between transactions. In this work, we present four transactional schedulers implemented entirely in Haskell using different abstraction levels. The results present, despite the inherent overhead of highlevel implementations, a reduction in the conflict rates.

Palavras-chave: Concurrent computing, Instruction sets, High performance computing, Processor scheduling, Indexes, Functional programming, Transactional Memory, Transaction scheduling, Collision avoidance and reduction