M. Ansari, M. Lujn, C. Kotselidis, K. Jarvis, C. C. Kirkham et al., Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering, HiPEAC 2009, pp.4-18
DOI : 10.1007/978-3-540-92990-1_3

URL : https://hal.archives-ouvertes.fr/inria-00439445

H. Attiya, L. Epstein, H. Shachnai, and T. Tamir, Transactional contention management as a non-clairvoyant scheduling problem, PODC 2006, pp.308-315

D. Dice, O. Shalev, and N. Shavit, Transactional Locking II, DISC 06, pp.194-208
DOI : 10.1007/11864219_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Dolev, D. Hendler, and A. Suissa, CAR-STM, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.125-134
DOI : 10.1145/1400751.1400769

A. Dragojevic, R. Guerraoui, and M. Kapalka, Stretching transactional memory, PLDI, pp.155-165, 2009.

A. Dragojevic, R. Guerraoui, A. V. Singh, and V. Singh, Preventing versus curing, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.7-16
DOI : 10.1145/1582716.1582725

M. R. Garey and R. L. Graham, Bounds for Multiprocessor Scheduling with Resource Constraints, SIAM Journal on Computing, vol.4, issue.2, pp.187-200, 1975.
DOI : 10.1137/0204015

R. Guerraoui, M. Herlihy, M. Kapa?ka, and B. Pochon, Robust contention management in software transactional memory, OOPSLA'05 Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL'05), 2005.

R. Guerraoui, M. Herlihy, and B. Pochon, Polymorphic Contention Management, DISC 2005, pp.303-323
DOI : 10.1007/11561927_23

R. Guerraoui, M. Herlihy, and B. Pochon, Toward a theory of transactional contention managers, PODC 2005, pp.258-264

R. Guerraoui and M. Kapalka, On the correctness of transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.175-184, 2008.
DOI : 10.1145/1345206.1345233

R. Guerraoui, M. Kapalka, and J. Vitek, Stmbench7: a benchmark for software transactional memory, EuroSys, pp.315-324, 2007.

M. Herlihy, V. Luchangco, M. Moir, W. N. Scherer, and I. , Software transactional memory for dynamic-sized data structures, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.92-101
DOI : 10.1145/872035.872048

W. Maldonado, P. Marlier, P. Felber, J. Lawall, and G. Muller, Transaction activation: Scheduling support for transactional memory, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00363376

R. Motwani, S. Phillips, and E. Torng, Nonclairvoyant scheduling, Theoretical Computer Science, vol.130, issue.1, pp.17-47, 1994.
DOI : 10.1016/0304-3975(94)90151-1

URL : http://doi.org/10.1016/0304-3975(94)90151-1

J. Napper and L. Alvisi, Lock-free serializable transactions, 2005.

C. H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM, vol.26, issue.4, pp.631-653, 1979.
DOI : 10.1145/322154.322158

D. Perelman and I. Keidar, On avoiding spare aborts in transactional memory, SPAA 2009, pp.59-68

N. William, I. Scherer, and M. L. Scott, Advanced contention management for dynamic software transactional memory, PODC 2005, pp.240-248

M. Richard, . Yoo, S. Hsien-hsin, and . Lee, Adaptive transaction scheduling for transactional memory systems, SPAA 2008, pp.169-178