Experiences using adaptive concurrency in transactional memory with lee's routing algorithm

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2008, Pages 261-262

  Ansari, Mohammad ^a   Kotselidis, Christos ^a   Jarvis, Kim ^a   Luján, Mikel ^a   Kirkham, Chris ^a   Watson, Ian ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Adaptive concurrency; DSTM2; Transactional memory

Indexed keywords

PARALLEL PROGRAMMING; ROUTING ALGORITHMS;

ADAPTIVE CONCURRENCY; DSTM2; HIGH CONTENTIONS; NUMBER OF THREADS; PERFORMANCE GAIN; RESOURCE USAGE; TRANSACTIONAL MEMORY;

STORAGE ALLOCATION (COMPUTER);

EID: 70449997248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1345206.1345246     Document Type: Conference Paper

References (4)

1. William Scherer III and Michael Scott, Contention Management in Dynamic Software Transactional Memory, Proceedings of the ACM PODC Workshop on Concurrency and Synchronization in Java Programs, St. John's, NL, Canada, Jul, 2004
2. Maurice Herlihy and Victor Luchangco and Mark Moir, A flexible framework for implementing software transactional memory, OOPSLA '06: Proceedings of the 21st Annual Conference on ObjectOriented Programming Systems, Languages, and Applications, Portland, Oregon, USA, Oct, 2006
3. Ian Watson and Chris Kirkham and Mikel Lujan, A Study of a Transactional Parallel Routing Algorithm, PACT '07: Proceedings of the 16th International Conference on Parallel Architectures and Compilation Techniques, Brasov, Romania, Sept, 2007
4. Mohammad Ansari and Christos Kotselidis and Kimberly Jarvis and Mikel Lujan and Chris Kirkham and Ian Watson, Adaptive Concurrency Control for Transactional Memory, Technical Report CSPP-43, School of Computer Science, University of Manchester, Sept, 2007