000139381 001__ 139381
000139381 005__ 20190316234603.0
000139381 037__ $$aREP_WORK
000139381 245__ $$aTransactors: Unifying Transactions and Actors
000139381 269__ $$a2009
000139381 260__ $$c2009
000139381 336__ $$aReports
000139381 520__ $$aComposability and deadlock-freedom are important properties that are stated for transactional memory (TM). Commonly, the Semantics of TM requires linearization of transactions. It turns out that linearization of transactions that have cyclic communication brings incomposability and deadlock. Inspired from TM and Actors, this work proposes Transactors that provide facilities of isolation from TM and communication from Actors. We define the semantics of Transactors including support for cyclic transactional communication. An algorithm implementing this semantics is offered. The soundness of the algorithm is proved.
000139381 6531_ $$aTransactional memory, Actors, Transactor
000139381 700__ $$aLesani, Mohsen
000139381 700__ $$0241835$$g126003$$aOdersky, Martin
000139381 700__ $$aGuerraoui, Rachid
000139381 8564_ $$zURL
000139381 8564_ $$uhttps://infoscience.epfl.ch/record/139381/files/Transactorsx.pdf$$zn/a$$s310833
000139381 909C0 $$xU10409$$0252187$$pLAMP
000139381 909CO $$qGLOBAL_SET$$pIC$$ooai:infoscience.tind.io:139381$$preport
000139381 937__ $$aLAMP-REPORT-2009-003
000139381 973__ $$sPUBLISHED$$aEPFL
000139381 980__ $$aREPORT