000146680 001__ 146680
000146680 005__ 20180913055656.0
000146680 0247_ $$2doi$$a10.5075/epfl-thesis-4664
000146680 02470 $$2urn$$aurn:nbn:ch:bel-epfl-thesis4664-2
000146680 02471 $$2nebis$$a5981258
000146680 037__ $$aTHESIS_LIB
000146680 041__ $$aeng
000146680 088__ $$a4664
000146680 245__ $$aTheory of Transactional Memory
000146680 269__ $$a2010
000146680 260__ $$aLausanne$$bEPFL$$c2010
000146680 300__ $$a179
000146680 336__ $$aTheses
000146680 520__ $$aTransactional memory (TM) is a promising paradigm       for concurrent programming, in which threads of an       application communicate, and synchronize their actions, via       inmemory transactions. Each transaction can perform       any number of operations on shared data, and then either       commit or abort. When the transaction commits,       the effects of all its operations become immediately visible       to other transactions; when it aborts, however, those effects       are entirely discarded. Transactions are atomic:       programmers get the illusion that every transaction executes       all its operations instantaneously, at some single and unique       point in time. The TM paradigm has raised a lot of hope for mastering the       complexity of concurrent programming. The aim is to provide       programmers with an abstraction, i.e., the transaction, that       makes handling concurrency as easy as with coarse-grained       locking, while exploiting the parallelism of the underlying       multi-core or multi-processor hardware as well as       hand-crafted fine-grained locking (which is typically an       engineering challenge). It is thus not surprising to see a       large body of work devoted to implementing this paradigm       efficiently, and integrating it with common programming       languages. Very little work, however, was devoted to the       underlying theory and principles. The aim of this thesis is to provide theoretical       foundations for transactional memory. This includes defining       a model of a TM, as well as answering precisely when a TM       implementation is correct, what kind of properties it can       ensure, what the power and limitations of a TM are, and what       inherent trade-offs are involved in designing a TM algorithm.       In particular, this manuscript contains precise definitions       of properties that capture the safety and progress semantics       of TMs, as well as several fundamental results related to       computability and complexity of TM implementations. While the       focus of the thesis is on theory, its goal is to capture the       common intuition behind the semantics of TMs and the       properties of existing TM implementations.
000146680 6531_ $$atransactional memory
000146680 6531_ $$aconcurrent programming
000146680 6531_ $$ashared memory
000146680 6531_ $$atheory
000146680 6531_ $$amémoire transactionnelle
000146680 6531_ $$aprogrammation concurrente
000146680 6531_ $$amémoire partagée
000146680 6531_ $$athéorie
000146680 700__ $$aKapalka, Michal
000146680 720_2 $$0240335$$aGuerraoui, Rachid$$edir.$$g105326
000146680 8564_ $$s743091$$uhttps://infoscience.epfl.ch/record/146680/files/EPFL_TH4664.pdf$$yTexte intégral / Full text$$zTexte intégral / Full text
000146680 909C0 $$0252114$$pDCL$$xU10407
000146680 909CO $$ooai:infoscience.tind.io:146680$$pDOI$$pIC$$pthesis$$pthesis-bn2018$$qDOI2
000146680 918__ $$aIC$$cIIF$$dEDIC2005-2015
000146680 919__ $$aLPD
000146680 920__ $$b2010
000146680 970__ $$a4664/THESES
000146680 973__ $$aEPFL$$sPUBLISHED
000146680 980__ $$aTHESIS