000			03656nam a22004095i 4500
999			_c387304 _d387304
001			387304
003			ES-MaUEC
005			20230312122558.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2010 sz | s |||| 0|eng d
020			_a9783031020025
024	7		_a10.1007/978-3-031-02002-5 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.642 _b2010 EB
100	1		_aGuerraoui, Rachid _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687258
245	1	0	_aPrinciples of Transactional Memory _cby Rachid Guerraoui, Michael Kapalka
250			_a1st edition 2010
264		1	_aCham _bSpringer International Publishing _c2010
300			_a1 recurso en línea (XIII, 179 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Distributed Computing Theory _x2155-1634
505	0		_aIntroduction -- Shared Memory Systems -- Transactional Memory: A Primer -- TM Correctness Issues -- Implementing a TM -- Further Reading -- Opacity -- Proving Opacity: An Example -- Opacity vs.\ Atomicity -- Further Reading -- The Liveness of a TM -- Lock-Based TMs -- Obstruction-Free TMs -- General Liveness of TMs -- Further Reading -- Conclusions.
520			_aTransactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads of an application communicate, and synchronize their actions, via in-memory 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. Yet, a TM runs transactions concurrently to leverage the parallelism offered by modern processors. The aim of this book 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 are the power and limitations of a TM, and what inherent trade-offs are involved in designing a TM algorithm. While the focus of this book is on the fundamental principles, its goal is to capture the common intuition behind the semantics of TMs and the properties of existing TM implementations. Table of Contents: Introduction / Shared Memory Systems / Transactional Memory: A Primer / TM Correctness Issues / Implementing a TM / Further Reading / Opacity / Proving Opacity: An Example / Opacity vs.\ Atomicity / Further Reading / The Liveness of a TM / Lock-Based TMs / Obstruction-Free TMs / General Liveness of TMs / Further Reading / Conclusions.
988			_aSynthesis Collection of Technology_2010
650		7	_2embne _9159594 _aProgramación en paralelo
700	1		_aKapalka, Michael _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687259
776	0	8	_iPrinted edition: _z9783031008740
776	0	8	_iPrinted edition: _z9783031031304
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02002-5 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI