000139006 001__ 139006
000139006 005__ 20190316234558.0
000139006 022__ $$a0129-6264
000139006 037__ $$aARTICLE
000139006 245__ $$aOn the Input Acceptance of Transactional Memory
000139006 269__ $$a2010
000139006 260__ $$bWorld Scientific Publishing$$c2010
000139006 336__ $$aJournal Articles
000139006 520__ $$aWe present the Input Acceptance of Transactional Memory (TM). Despite the large interest for performance of TMs, no existing research work has investigated the impact of solving a conflict that does not need to be solved. Traditional solutions for a TM to be correct is to delay or abort a transaction as soon as it presents a risk to violate consistency. Both alternatives are costly and should be avoided if consistency is actually preserved. To address this problem, we introduce the input acceptance of a TM as its ability to commit transactions, we upper-bound the input acceptance of existing TMs and propose a new TM with higher input acceptance.
000139006 6531_ $$aSSTM
000139006 6531_ $$aCommit-abort ratio
000139006 6531_ $$aReal-time relaxation
000139006 700__ $$0242987$$g183046$$aGramoli, Vincent
000139006 700__ $$aHarmanci, Derin
000139006 700__ $$aFelber, Pascal
000139006 773__ $$j20$$tParallel Processing Letters$$k1$$q31-50
000139006 8564_ $$uhttps://infoscience.epfl.ch/record/139006/files/ppl2010.pdf$$zn/a$$s447520$$yn/a
000139006 909C0 $$xU10407$$0252114$$pDCL
000139006 909CO $$ooai:infoscience.tind.io:139006$$qGLOBAL_SET$$pIC$$particle
000139006 917Z8 $$x183046
000139006 917Z8 $$x148230
000139006 917Z8 $$x148230
000139006 937__ $$aLPD-ARTICLE-2009-004
000139006 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000139006 980__ $$aARTICLE