Transactional access to shared memory in StarSs, a task based programming model
Tipus de documentText en actes de congrés
Condicions d'accésAccés restringit per política de l'editorial
With an increase in the number of processors on a single chip, programming environments which facilitate the exploitation of par- allelism on multicore architectures have become a necessity. StarSs is a task-based programming model that enables a flexible and high level programming. Although task synchronization in StarSs is based on data flow and dependency analysis, some applications (e.g. reductions )require locks to access shared data. Transactional Memory is an alternative to lock-based synchronization for controlling access to shared data. In this paper we explore the idea of integrating a lightweight Software Transactional Memory (STM) library, TinySTM , into an implementation of StarSs (SMPSs). The SMPSs run- time and the compiler have been modified to include and use calls to the STM library. We evaluated this approach on four applications and observe better performance in applications with high lock contention.
CitacióGayatri, R. [et al.]. Transactional access to shared memory in StarSs, a task based programming model. A: International Conference on Parallel Processing. "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)". Rhodes Island: 2012, p. 514-525.
Versió de l'editorhttp://link.springer.com/content/pdf/10.1007%2F978-3-642-32820-6_51.pdf