Optimizing Dynamic Memory Allocation for Software Transactional Memory Systems

• Grant number: 12/12486-2
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: August 01, 2012
• End date: July 31, 2013
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Computer Systems
• Principal Investigator: Alexandro José Baldassin
• Grantee: Matheus Antonio da Silva
• Host Institution: Instituto de Geociências e Ciências Exatas (IGCE). Universidade Estadual Paulista (UNESP). Campus de Rio Claro. Rio Claro , SP, Brazil
• Associated research grant: 11/19373-6 - Understanding and Exploiting Energy/Performance Tradeoffs in Concurrent Algorithms, AP.JP

Abstract

The widespread use of multicore processors has renewed the interest in parallelism. In particular, a new concurrent programming paradigm known as transactional memory has attracted the attention of both Academy and Industry. The major difference from the transactional approach to the classicalsynchronization methods such as locks is on its higher abstraction level, an essential element for the development and maintenance of concurrent applications. However, software implementation of the transactional framework are largely criticized for its low performance. As a result, much of the research conducted in the last years has focused on the improvement of transactionalalgorithms so that the performance overhead can be reduced. Following this research line, this project aims at improving the efficiency of the software implementations of the transactional mechanism by exploiting an aspect that received little attention: dynamic memory allocation performed among transactions. Initially we intend to analyze the performance overhead due to the dynamic allocator and, based on this analysis, we seek to propose an allocation methodology especially devised to the transactional memory domain.