Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Turbocharging boosted transactions or: how I learnt to stop worrying and love longer transactions

Autor
Kulkarni, C.; Unsal, O.; Cristal, A.; Ayguade, E.; Valero, M.
Tipus d'activitat
Article en revista
Revista
ACM SIGPLAN notices
Data de publicació
2009-04
Volum
44
Número
4
Pàgina inicial
307
Pàgina final
308
DOI
https://doi.org/10.1145/1594835.1504228 Obrir en finestra nova
URL
http://dl.acm.org/citation.cfm?id=1504176.1504228&coll=DL&dl=ACM&CFID=521677740&CFTOKEN=91791992 Obrir en finestra nova
Resum
Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted transactions get larger, they become more susceptible to conflicts and aborts. We describe a linear-time algorithm to detect transactions that cannot make progress, which transactions need to be aborted, and when. The algorithm guarantees zero false positives with minimal aborts. Our proposals, as implemented in DSTM2, incr...
Paraules clau
Concurrency, Deadlock-detection, Deadlocks, Parallel programming, Transactional memory
Grup de recerca
CAP - Grup de Computació d'Altes Prestacions

Participants