000 | 03387nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-658-07597-2 | ||
003 | DE-He213 | ||
005 | 20200421112043.0 | ||
007 | cr nn 008mamaa | ||
008 | 141009s2014 gw | s |||| 0|eng d | ||
020 |
_a9783658075972 _9978-3-658-07597-2 |
||
024 | 7 |
_a10.1007/978-3-658-07597-2 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM018000 _2bisacsh |
|
072 | 7 |
_aMAT003000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aF�orster, Michael. _eauthor. |
|
245 | 1 | 0 |
_aAlgorithmic Differentiation of Pragma-Defined Parallel Regions _h[electronic resource] : _bDifferentiating Computer Programs Containing OpenMP / _cby Michael F�orster. |
264 | 1 |
_aWiesbaden : _bSpringer Fachmedien Wiesbaden : _bImprint: Springer Vieweg, _c2014. |
|
300 |
_aXI, 405 p. 41 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _aIntroduction with Examples from Numerical Optimization -- Algorithmic Differentiation by Source Transformation -- Transformation rules for Parallel Code Regions (e.g. OpenMP 3.1) -- Static Program Analysis. | |
520 | _aNumerical programs often use parallel programming techniques such as OpenMP to compute the program's output values as efficient as possible. In addition, derivative values of these output values with respect to certain input values play a crucial role. To achieve code that computes not only the output values simultaneously but also the derivative values, this work introduces several source-to-source transformation rules. These rules are based on a technique called algorithmic differentiation. The main focus of this work lies on the important reverse mode of algorithmic differentiation. The inherent data-flow reversal of the reverse mode must be handled properly during the transformation. The first part of the work examines the transformations in a very general way since pragma-based parallel regions occur in many different kinds such as OpenMP, OpenACC, and Intel Phi. The second part describes the transformation rules of the most important OpenMP constructs. Contents Introduction with Examples from Numerical Optimization Algorithmic Differentiation by Source Transformation Transformation rules for Parallel Code Regions (e.g. OpenMP 3.1) Static Program Analysis Target Groups Lecturers and students of computer science Computer scientists, engineers, mathematicians and numerical analysts The Author Michael F�orster is currently Research Associate of the Institute Software and Tools for Computational Engineering, RWTH Aachen University. | ||
650 | 0 | _aComputer science. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aComputers. | |
650 | 0 | _aApplied mathematics. | |
650 | 0 | _aEngineering mathematics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematics of Computing. |
650 | 2 | 4 | _aComputing Methodologies. |
650 | 2 | 4 | _aAppl.Mathematics/Computational Methods of Engineering. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783658075965 |
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-658-07597-2 |
912 | _aZDB-2-SCS | ||
942 | _cEBK | ||
999 |
_c56738 _d56738 |