000			03289nam a2200397 i 4500
999			_c386954 _d386954
001			386954
003			ES-MaUEC
005			20230130111931.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2012 sz | o |||| 0|eng d
020			_a9783031017360
024	7		_a10.1007/978-3-031-01736-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.58 _b2012 EB
100	1		_aMidkiff, Samuel P. _q(Samuel Pratt) _d1954- _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686307
245	1	0	_aAutomatic Parallelization : _bAn Overview of Fundamental Compiler Techniques _cby Samuel Midkiff
250			_a1st edition 2012
264		1	_aCham _bSpringer International Publishing _c2012
300			_a1 recurso en línea (XII, 157 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 Computer Architecture _x1935-3243
505	0		_aIntroduction and overview -- Dependence analysis, dependence graphs and alias analysis -- Program parallelization -- Transformations to modify and eliminate dependences -- Transformation of iterative and recursive constructs -- Compiling for distributed memory machines -- Solving Diophantine equations -- A guide to further reading.
520			_aCompiling for parallelism is a longstanding topic of compiler research. This book describes the fundamental principles of compiling "regular" numerical programs for parallelism. We begin with an explanation of analyses that allow a compiler to understand the interaction of data reads and writes in different statements and loop iterations during program execution. These analyses include dependence analysis, use-def analysis and pointer analysis. Next, we describe how the results of these analyses are used to enable transformations that make loops more amenable to parallelization, and discuss transformations that expose parallelism to target shared memory multicore and vector processors. We then discuss some problems that arise when parallelizing programs for execution on distributed memory machines. Finally, we conclude with an overview of solving Diophantine equations and suggestions for further readings in the topics of this book to enable the interested reader to delve deeper into the field. Table of Contents: Introduction and overview / Dependence analysis, dependence graphs and alias analysis / Program parallelization / Transformations to modify and eliminate dependences / Transformation of iterative and recursive constructs / Compiling for distributed memory machines / Solving Diophantine equations / A guide to further reading.
988			_aSynthesis Collection of Technology_2012
650		7	_2embne _9158747 _aProceso paralelo (Informática)
776	0	8	_iPrinted edition: _z9783031006081
776	0	8	_iPrinted edition: _z9783031028649
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-01736-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b01/2023 _dz _eb _zSI